356 search results - page 56 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
WG
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
112
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
124
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
109
Voted
MM
2003
ACM
15 years 5 months ago
2003
ACM
An algorithm is presented that automatically matches images of presentation slides to the symbolic source file (e.g., PowerPointTM or AcrobatTM ) from which they were generated. T...
111
click to vote
3DPVT
2002
IEEE
15 years 5 months ago
2002
IEEE
In many applications surfaces with a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by...