1729 search results - page 3 / 346 » On Bounds for the k-Partitioning of Graphs |
SIAMDM
2010
13 years 4 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
PC
2008
13 years 9 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
IPL
2010
13 years 8 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
GC
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
SIAMCOMP
2011
13 years 18 days ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...