Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
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 “Jamming and geometric representations of graphs.”
Computing radial drawings on the minimum number of circles.
Algorithms for investigating optimality of cone triangulation for a polyhedron
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity:
A split&push approach to orthogonal drawing.
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Drawing graphs on two and three lines.
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
Geometric simultaneous embeddings of a graph and a matching.
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)
Journal of Graph Algorithms and Applications
Similarity:
Drawing in three dimensions with one bend per edge.
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)
Journal of Graph Algorithms and Applications
Similarity:
-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity: