Sciweavers

134 search results - page 22 / 27
» Induced Subgraphs of Bounded Degree and Bounded Treewidth
Sort
View
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 5 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
ICALP
2005
Springer
15 years 5 months ago
Preservation Under Extensions on Well-Behaved Finite Structures
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
Albert Atserias, Anuj Dawar, Martin Grohe
DISOPT
2007
155views more  DISOPT 2007»
14 years 11 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
WG
2000
Springer
15 years 3 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
JNW
2007
104views more  JNW 2007»
14 years 11 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad