4865 search results - page 249 / 973 » The Complexity of Graph Connectivity |
161
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
161
click to vote
ASWEC
2004
IEEE
15 years 9 months ago
2004
IEEE
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
169
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
200
click to vote
ICALP
2007
Springer
16 years 5 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...
151
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...