Sciweavers

7913 search results - page 302 / 1583
» Information Collection on a Graph
Sort
View
CIKM
2007
Springer
15 years 5 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
BMCBI
2007
200views more  BMCBI 2007»
15 years 1 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...
115
Voted
NAR
2011
209views Computer Vision» more  NAR 2011»
14 years 3 months ago
REPAIRtoire - a database of DNA repair pathways
REPAIRtoire is the first comprehensive database resource for systems biology of DNA damage and repair. The database collects and organizes the following types of information: (i) ...
Kaja Milanowska, Joanna Krwawicz, Grzegorz Papaj, ...
110
Voted
WWW
2008
ACM
16 years 1 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
111
Voted
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 5 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002