Sciweavers

1395 search results - page 76 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
STACS
2007
Springer
15 years 9 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
168
Voted
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 6 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
159
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 9 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
166
Voted
ACID
2006
237views Algorithms» more  ACID 2006»
15 years 5 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
VLDB
2009
ACM
151views Database» more  VLDB 2009»
16 years 3 months ago
Containment of partially specified tree-pattern queries in the presence of dimension graphs
Dimitri Theodoratos, Pawel Placek, Theodore Dalama...