Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Elimination of local bridges”
Connectivity of planar graphs.
A fast multi-scale method for drawing large graphs.
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
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.
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Theorem proving through depth-first test
Zsolt Tuza (1992)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
An efficient -centroid location algorithm for cographs.
Prakash, V. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity: