DCG
2000
13 years 11 months ago
2000
This paper examines directed graphs related to convex polytopes. For each fixed d-polytope and any acyclic orientation of its graph, we prove there exist both convex and concave fu...
DAM
2007
13 years 11 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...
IPL
2008
13 years 11 months ago
2008
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
SBACPAD
2003
IEEE
14 years 4 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...