2911 search results - page 307 / 583 » A Logic of Graph Constraints |
161
Voted
DAM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
198
click to vote
PAMI
2006
15 years 6 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
185
click to vote
PVLDB
2010
15 years 5 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
158
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
194
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...