A fast multi-scale method for drawing large graphs.
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “On polynomial time decidability of induced-minor-closed classes”
A fast multi-scale method for drawing large graphs.
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Treewidth and minimum fill-in on -trapezoid graphs.
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
A note on the computational complexity of computing the edge rotation distance between graphs
Mirko Křivánek (1988)
Časopis pro pěstování matematiky
Similarity:
Heuristic and metaheuristic methods for computing graph treewidth
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very...
A linear algorithm to recognize maximal generalized outerplanar graphs
José Cáceres, Alberto Márquez (1997)
Mathematica Bohemica
Similarity:
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.