96 search results - page 2 / 20 » Path Hitting in Acyclic Graphs |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
ESA
2003
Springer
14 years 17 days ago
2003
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
TON
2010
13 years 5 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...