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 “Efficient drawing of RNA secondary structure.”
Radial level planarity testing and embedding in linear time.
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.
Garg, Ashim, Rusu, Adrian (2004)
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...
Balanced aspect ratio trees and their use for drawing large graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Level planar embedding in linear time.
Jünger, Michael, Leipert, Sebastian (2002)
Journal of Graph Algorithms and Applications
Similarity:
A Bicriterion Steiner Tree Problem on Graph
Mirko Vujošević, Milan Stanojević (2003)
The Yugoslav Journal of Operations Research
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:
Simple and efficient bilayer cross counting.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
A framework for the static and interactive visualization of statecharts.
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Worst-case relative performances of heuristics for the Steiner problem in graphs.
Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Clustering in trees: Optimizing cluster sizes and number of subtrees.
Hambrusch, Susanne E., Liu, Chuan-Ming, Lim, Hyeong-Seok (2000)
Journal of Graph Algorithms and Applications
Similarity:
Approximation algorithms for metric tree cover and generalized tour and tree covers
Viet Hung Nguyen (2007)
RAIRO - Operations Research
Similarity:
Given a weighted undirected graph , a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of . Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations...