1172 search results - page 135 / 235 » Path Algorithms on Regular Graphs |
96
Voted
COMGEO
2010
ACM
15 years 22 days ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
122
Voted
TON
2010
14 years 7 months ago
2010
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
147
Voted
ICALP
2009
Springer
16 years 27 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
116
click to vote
ESWS
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
101
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...