505 search results - page 1 / 101 » On A Graph Formalism for Ordered Edges |
ECEASST
2010
13 years 2 months ago
2010
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
WSR
2008
13 years 6 months ago
2008
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
CCCG
2010
13 years 6 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
WG
2001
Springer
13 years 9 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...