Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
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 “The Capacitated Arc Routing Problem. A heuristic algorithm.”
Drawing planar graphs with large vertices and thick edges.
Experiments with the fixed-parameter approach for two-layer planarization.
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
A factor-two approximation algorithm for two-dimensional phase unwrapping.
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
Two-layer planarization: improving on parameterized algorithmics.
Fernau, Henning (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:
Theorem proving through depth-first test
Zsolt Tuza (1992)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Visualization of the high level structure of the internet with Hermes.
Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)
Journal of Graph Algorithms and Applications
Similarity:
An efficient implementation of Sugiyama's algorithm for layered graph drawing.
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Memory paging for connectivity and path problems in graphs.
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto (1998)
Journal of Graph Algorithms and Applications
Similarity:
The traveling salesman problem for cubic graphs.
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity: