Simultaneous graph drawing: layout algorithms and visualization schemes.
Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Graph drawing by high-dimensional embedding.”
Simultaneous graph drawing: layout algorithms and visualization schemes.
Graph drawing in motion.
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity:
A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
Journal of Graph Algorithms and Applications
Similarity:
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (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:
Drawing graphs within graphs.
Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)
Journal of Graph Algorithms and Applications
Similarity:
An Algorithm To Recognize A Generalized Line Graph And Output It's Root Graph
Slobodan K. Simić (1991)
Publications de l'Institut Mathématique
Similarity:
Algorithms for cluster busting in anchored graph drawing.
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
A method of constructing the frame of a directed graph
Ichiro Hofuku, Kunio Oshima (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of...