Sciweavers

1633 search results - page 45 / 327
» Planar Map Graphs
Sort
View
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 8 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 9 months ago
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
Frédéric Mazoit
JDA
2010
122views more  JDA 2010»
13 years 3 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
STACS
2000
Springer
14 years 16 days ago
The Complexity of Planarity Testing
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
Eric Allender, Meena Mahajan
COCOA
2010
Springer
13 years 7 months ago
Listing Triconnected Rooted Plane Graphs
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
Bingbing Zhuang, Hiroshi Nagamochi