47 search results - page 10 / 10 » Independence number and clique minors |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
CGF
2005
13 years 5 months ago
2005
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...