1729 search results - page 99 / 346 » On Bounds for the k-Partitioning of Graphs |
DAM
2007
14 years 10 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
WG
2001
Springer
15 years 2 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
110
click to vote
ICINCO
2009
14 years 7 months ago
2009
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
MST
2010
14 years 4 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
141
click to vote
PODC
2011
ACM
14 years 25 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...