1729 search results - page 140 / 346 » On Bounds for the k-Partitioning of Graphs |
159
click to vote
SIROCCO
2007
15 years 7 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
169
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
171
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
164
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
174
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...