35 search results - page 4 / 7 » Solving Connected Subgraph Problems in Wildlife Conservation |
KDD
2006
ACM
14 years 6 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
DAM
2010
13 years 5 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
JCO
2010
13 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
TCS
2008
13 years 5 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...