369 search results - page 3 / 74 » Layouts of Graph Subdivisions |
IV
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper contains details of new criteria for graph layout, based on the concepts used in graphical design. Current graph layout criteria have been shown to be effective in meas...
JGAA
2007
13 years 7 months ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
GD
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...