Level planar embedding in linear time.
Jünger, Michael, Leipert, Sebastian (2002)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Planarity testing and optimal edge insertion with embedding constraints.”
Level planar embedding in linear time.
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Radial level planarity testing and embedding in linear time.
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Some graphic uses of an even number of odd nodes
Kathie Cameron, Jack Edmonds (1999)
Annales de l'institut Fourier
Similarity:
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.
Upward embeddings and orientations of undirected planar graphs.
Didimo, Walter, Pizzonia, Maurizio (2003)
Journal of Graph Algorithms and Applications
Similarity:
Geometric simultaneous embeddings of a graph and a matching.
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)
Journal of Graph Algorithms and Applications
Similarity:
Algorithms for single link failure recovery and related problems.
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
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: