2294 search results - page 111 / 459 » From Path Graphs to Directed Path Graphs |
187
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
149
click to vote
COCOON
2007
Springer
16 years 16 days ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
213
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
160
click to vote
GD
2007
Springer
16 years 16 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
148
click to vote
VR
1993
IEEE
15 years 10 months ago
1993
IEEE
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...