3008 search results - page 175 / 602 » Independence in connected graphs |
193
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
166
click to vote
GC
2006
Springer
15 years 6 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
174
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
159
click to vote
ACL
2009
15 years 4 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...
204
click to vote
CAI
2007
Springer
16 years 21 days ago
2007
Springer
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...