2503 search results - page 54 / 501 » A study of 3-arc graphs |
198
click to vote
ICALP
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
149
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
153
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
159
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
182
click to vote
SIAMDM
2010
15 years 4 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...