77 search results - page 1 / 16 » Robust Subgraphs for Trees and Paths |
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
ALGORITHMICA
2006
13 years 4 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...
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
SAC
2010
ACM
13 years 11 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...