32 search results - page 2 / 7 » Sinks in Acyclic Orientations of Graphs |
DAM
2007
13 years 8 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
CPC
2004
13 years 8 months ago
2004
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
JGT
2008
13 years 8 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...