3757 search results - page 416 / 752 » The overlap number of a graph |
214
Voted
ADHOCNOW
2004
Springer
16 years 4 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
169
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
192
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
181
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
187
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...