1729 search results - page 173 / 346 » On Bounds for the k-Partitioning of Graphs |
169
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
184
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
176
click to vote
SIROCCO
2007
15 years 8 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
224
click to vote
IJDAR
2006
15 years 6 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
167
click to vote
SOFSEM
2007
Springer
16 years 18 days ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...