4865 search results - page 232 / 973 » The Complexity of Graph Connectivity |
141
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
142
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
152
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
135
click to vote
AVI
2004
15 years 6 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
144
Voted
JCT
2006
15 years 5 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...