Techniques for the refinement of orthogonal graph drawings.
Six, Janet M., Kakoulis, Konstantinos G., Tollis, Ioannis G. (2000)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A framework for the static and interactive visualization of statecharts.”
Techniques for the refinement of orthogonal graph drawings.
Simple and efficient bilayer cross counting.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Algorithms for cluster busting in anchored graph drawing.
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Orthogonal hypergraph drawing for improved visibility.
Eschbach, Thomas, Guenther, Wolfgang, Becker, Bernd (2006)
Journal of Graph Algorithms and Applications
Similarity:
TimGA: A genetic algorithm for drawing undirected graphs.
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
Efficient drawing of RNA secondary structure.
Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)
Journal of Graph Algorithms and Applications
Similarity:
Radial level planarity testing and embedding in linear time.
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
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:
Scheduling trajectories on a planar surface with moving obstacles.
Stefanakis, Emmanuel (2004)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
A broadcasting algorithm with time and message optimum on arrangement graphs.
Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo (1998)
Journal of Graph Algorithms and Applications
Similarity:
Algorithms for single link failure recovery and related problems.
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Navigating clustered graphs using force-directed methods.
Eades, Peter, Huang, Lin Mao (2000)
Journal of Graph Algorithms and Applications
Similarity: