1729 search results - page 229 / 346 » On Bounds for the k-Partitioning of Graphs |
174
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
139
click to vote
CSL
2009
Springer
16 years 28 days ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
168
click to vote
COCOON
2007
Springer
16 years 16 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
164
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
164
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...