141 search results - page 18 / 29 » Layout Problems on Lattice Graphs |
ATMOS
2010
14 years 8 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
GD
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
GBRPR
2007
Springer
15 years 3 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
SOFTVIS
2006
ACM
15 years 3 months ago
2006
ACM
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...