3211 search results - page 337 / 643 » On the Grundy Number of a Graph |
170
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 ...
196
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...