356 search results - page 30 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
101
click to vote
DAM
1999
15 years 1 days ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
113
Voted
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
109
click to vote
SODA
1996
ACM
15 years 1 months ago
1996
ACM
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
102
click to vote
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
111
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...