11381 search results - page 48 / 2277 » Connectivity |
ACL
2009
14 years 7 months ago
2009
Discourse connectives are words or phrases such as once, since, and on the contrary that explicitly signal the presence of a discourse relation. There are two types of ambiguity t...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
HM
2007
Springer
15 years 3 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
104
click to vote
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...