990 search results - page 95 / 198 » Sub-Graphs of Complete Graph |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
DM
2008
13 years 9 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
ALGORITHMICA
2006
13 years 9 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
EJC
2008
13 years 9 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...