Radial level planarity testing and embedding in linear time.
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Level planar embedding in linear time.”
Radial level planarity testing and embedding in linear time.
Programming and Testing a Two-Tree Algorithm
Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...
Planarity testing and optimal edge insertion with embedding constraints.
Gutwenger, Carsten, Klein, Karsten, Mutzel, Petra (2008)
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:
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
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:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Efficient drawing of RNA secondary structure.
Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)
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:
Deciding clique-width for graphs of bounded tree-width.
Espelage, Wolfgang, Gurski, Frank, Wanke, Egon (2003)
Journal of Graph Algorithms and Applications
Similarity:
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
On the number of genus one labeled circle trees.
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: