4403 search results - page 527 / 881 » Galois Theory of Algorithms |
205
click to vote
CIAC
2003
Springer
16 years 25 days ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
220
click to vote
COCOON
2003
Springer
16 years 25 days ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
178
click to vote
COMPGEOM
2010
ACM
16 years 20 days ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
202
click to vote
GLVLSI
2002
IEEE
16 years 17 days ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
232
click to vote
COMPGEOM
2009
ACM
16 years 8 days ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...