Simple and efficient bilayer cross counting.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Spanning trees with low crossing number”
Simple and efficient bilayer cross counting.
A few remarks on the history of MST-problem
Jaroslav Nešetřil (1997)
Archivum Mathematicum
Similarity:
On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.
A probabilistic analysis of a new satisfiability algorithm
B. Apolloni, S. Di Gregorio (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
Paulden, Tim, Smith, David K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Parallel computation on 2-3-trees
W. Paul, U. Vishkin, H. Wagener (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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:
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...