127 search results - page 7 / 26 » The Directed Planar Reachability Problem |
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional R √ 1 + K2 ds, depending both on le...
PVLDB
2010
13 years 8 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
MOBICOM
2012
ACM
12 years 7 days ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...