Radial level planarity testing and embedding in linear time.

Bachmaier, Christian; Brandenburg, Franz J.; Forster, Michael

Displaying similar documents to “Radial level planarity testing and embedding in linear time.”

Level planar embedding in linear time.

Jünger, Michael, Leipert, Sebastian (2002)

Journal of Graph Algorithms and Applications

Similarity:

Efficient drawing of RNA secondary structure.

Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)

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:

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...