Add to ORKGThis poster empirically investigates the quality of large graph layouts using shape-based quality metrics. We present our preliminary results on several real-world graphs
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
With the continuing ability to gather and store increasingly larger amounts of data, so has grown th...
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that wi...
This poster empirically investigates the quality of large graph layouts using shape-based quality me...
We propose a new family of quality metrics for graph drawing; in particular, we concentrate on large...
In the last decade several algorithms that generate straight-line drawings of general large graphs h...
This paper contains details of new criteria for graph layout, based on the concepts used in graphica...
Shape-based metrics measure how faithfully a drawing D of a large graph G shows the structure of gra...
Directed and undirected graphs provide a natural notation for describing many fundamental structures...
How good is a given graph clustering, graph layout, or graph ordering – specifically, how well does ...
When looking at drawings of graphs, questions about graph density, community structures, local clust...
Force-directed graph layout is a widely used algorithm for the automatic layout of graphs. Little ex...
When comparing two different styles to draw a graph, one can wonder how much better or worse one sty...
Reducing the number of edge crossings is considered one of the most important graph drawing aestheti...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
With the continuing ability to gather and store increasingly larger amounts of data, so has grown th...
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that wi...
This poster empirically investigates the quality of large graph layouts using shape-based quality me...
We propose a new family of quality metrics for graph drawing; in particular, we concentrate on large...
In the last decade several algorithms that generate straight-line drawings of general large graphs h...
This paper contains details of new criteria for graph layout, based on the concepts used in graphica...
Shape-based metrics measure how faithfully a drawing D of a large graph G shows the structure of gra...
Directed and undirected graphs provide a natural notation for describing many fundamental structures...
How good is a given graph clustering, graph layout, or graph ordering – specifically, how well does ...
When looking at drawings of graphs, questions about graph density, community structures, local clust...
Force-directed graph layout is a widely used algorithm for the automatic layout of graphs. Little ex...
When comparing two different styles to draw a graph, one can wonder how much better or worse one sty...
Reducing the number of edge crossings is considered one of the most important graph drawing aestheti...
Many automatic graph layout algorithms have been designed and implemented to display relational data...
Designers of graph drawing algorithms and systems claim to illuminate application data by producing ...
With the continuing ability to gather and store increasingly larger amounts of data, so has grown th...
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that wi...