2294 search results - page 63 / 459 » From Path Graphs to Directed Path Graphs |
170
click to vote
HUMAN
2003
Springer
15 years 11 months ago
2003
Springer
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
153
click to vote
DBPL
1993
Springer
15 years 10 months ago
1993
Springer
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments , an object-oriented data model at the core of a scient...
156
click to vote
JGT
2006
15 years 6 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
180
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
172
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...