Implementation of directed acyclic word graph

Miroslav Balík

Displaying similar documents to “Implementation of directed acyclic word graph”

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:

Visualization of the high level structure of the internet with Hermes.

Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)

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.