Sciweavers

469 search results - page 27 / 94
» Directed Graphs of Entanglement Two
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
14 years 3 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...
CPAIOR
2007
Springer
14 years 3 months ago
Necessary Condition for Path Partitioning Constraints
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
Nicolas Beldiceanu, Xavier Lorca
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
14 years 1 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
TIP
2008
99views more  TIP 2008»
13 years 8 months ago
Using Spanning Graphs for Efficient Image Registration
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
Mert R. Sabuncu, Peter J. Ramadge