Sciweavers

100 search results - page 17 / 20
» Closure and factor-critical graphs
Sort
View
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 6 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
ODBIS
2007
Springer
115views Database» more  ODBIS 2007»
14 years 1 months ago
On the Synthetic Generation of Semantic Web Schemas
In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SW tools (e.g., query language interpreters) in a credible manne...
Yannis Theoharis, George Georgakopoulos, Vassilis ...
DBA
2004
93views Database» more  DBA 2004»
13 years 8 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke