Sciweavers

3105 search results - page 127 / 621
» The Path-Packing Structure of Graphs
Sort
View
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 9 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 7 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
15 years 1 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
KBSE
2005
IEEE
15 years 9 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
132
Voted
JSSPP
2010
Springer
15 years 1 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li