1736 search results - page 137 / 348 » The rank-width of Directed Graphs |
151
Voted
HASE
1999
IEEE
15 years 8 months ago
1999
IEEE
The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend...
152
click to vote
USS
2008
15 years 6 months ago
2008
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
141
Voted
CCCG
2008
15 years 6 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
129
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...