Sciweavers

2 search results - page 1 / 1
» Recognizing Hole-Free 4-Map Graphs in Cubic Time
Sort
View
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 11 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
DAM
1999
99views more  DAM 1999»
13 years 10 months ago
Recognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
Wilfried Imrich, Sandi Klavzar