1395 search results - page 118 / 279 » (k, )-Distance-Hereditary Graphs |
108
click to vote
FAW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
102
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
AAIM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
WADS
1993
Springer
15 years 2 months ago
1993
Springer
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...