463 search results - page 34 / 93 » The Most Reliable Subgraph Problem |
105
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
96
Voted
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
123
click to vote
COMCOM
2006
15 years 1 months ago
2006
One feature common to most existing routing protocols for wireless mobile ad hoc networks, or MANETs, is the need to flood control messages network-wide during the route acquisiti...
144
click to vote
AC
2000
Springer
15 years 6 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
112
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...