Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.

Displaying similar documents to “Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.”

Biedl, Therese C. (1998)

Journal of Graph Algorithms and Applications

Similarity:

Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)

Journal of Graph Algorithms and Applications

Similarity:

Closson, M., Gartshore, S., Johansen, J., Wismath, S.K. (2001)

Journal of Graph Algorithms and Applications

Similarity:

Biedl, T., Shermer, T., Whitesides, S., Wismath, S. (1999)

Journal of Graph Algorithms and Applications

Similarity:

Felsner, Stefan, Zickfeld, Florian (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bose, Prosenjit, Czyzowicz, Jurek, Morin, Pat, Wood, David R. (2004)

Journal of Graph Algorithms and Applications

Similarity:

Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)

Journal of Graph Algorithms and Applications

Similarity:

Kaufmann, Michael, Wiese, Roland (2002)

Journal of Graph Algorithms and Applications

Similarity:

Marián Klešč (1991)

Mathematica Slovaca

Similarity:

Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)

Journal of Graph Algorithms and Applications

Similarity:

Di Battista, Giuseppe, Patrignani, Maurizio (2000)

Journal of Graph Algorithms and Applications

Similarity: