Amanote Research

Amanote Research

    RegisterSign In

Solvable Probabilistic Model for Cycles in Planar Graph

Interdisciplinary Information Sciences
doi 10.4036/iis.2009.301
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2009

Authors
Kazuyuki TANAKAValery VAN KERREBROECK
Publisher

Graduate School of Information Sciences, Tohoku University


Related search

Probabilistic Graph Models for Landscape Genetics

2016English

Probabilistic Graph-Clear

2009English

Planar Graph Blocking for External Searching

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Every Planar Graph Without Cycles of Lengths 4 to 12 Is Acyclically 3-Choosable

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2009English

Multiscale Planar Graph Generation

Applied Network Science
Computational MathematicsCommunicationsMultidisciplinaryComputer Networks
2019English

Cycles in Graph Theory and Matroids

English

A Solvable Model for Gravity Driven Granular Dynamics

Dynamical Systems
MathematicsComputer Science Applications
2005English

Anharmonic Collective Excitation in a Solvable Model

Nuclear Physics A
High Energy PhysicsNuclear
1999English

A Probabilistic Search Algorithm for Finding Suboptimal Branchings in Mutually Exclusive Hypothesis Graph

International Journal of Knowledge-Based and Intelligent Engineering Systems
ControlSystems EngineeringArtificial IntelligenceSoftware
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy