296 search results - page 30 / 60 » Group connectivity of certain graphs |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
MSR
2005
ACM
14 years 1 months ago
2005
ACM
Since code revisions reflect the extent of human involvement in the software development process, revision histories reveal the interactions and interfaces between developers and...
NIPS
2004
13 years 9 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
ESA
2003
Springer
14 years 23 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
WG
1998
Springer
13 years 11 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...