1729 search results - page 62 / 346 » On Bounds for the k-Partitioning of Graphs |
FSTTCS
2009
Springer
15 years 2 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
DM
2008
14 years 10 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
COMBINATORICA
2006
14 years 10 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...