459 search results - page 45 / 92 » Detecting induced subgraphs |
ICCS
1997
Springer
14 years 19 days ago
1997
Springer
The name of the system is \THE CG MARS LANDER", which stands forType Hierarchy Enhanced CGMatching And Retrieval SystemLinear Associative N-tuple Deductive Embedded Representa...
ESA
2006
Springer
14 years 4 days ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...