I/O-optimal algorithms for outerplanar graphs.

Maheshwari, Anil; Zeh, Norbert

Displaying similar documents to “I/O-optimal algorithms for outerplanar graphs.”

On the cutting edge: simplified $O (n)$ planarity by edge addition.

Boyer, John M., Myrvold, Wendy J. (2004)

Journal of Graph Algorithms and Applications

Similarity:

On external-memory planar depth first search.

Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)

Journal of Graph Algorithms and Applications

Similarity:

An efficient implementation of Sugiyama's algorithm for layered graph drawing.

Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)

Journal of Graph Algorithms and Applications

Similarity:

Experiments with the fixed-parameter approach for two-layer planarization.

Suderman, Matthew, Whitesides, Sue (2005)

Journal of Graph Algorithms and Applications

Similarity:

Computing radial drawings on the minimum number of circles.

Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)

Journal of Graph Algorithms and Applications

Similarity:

On the Vertex Separation of Maximal Outerplanar Graphs

Markov, Minko (2008)

Serdica Journal of Computing

Similarity:

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.