239 search results - page 11 / 48 » The path partition problem and related problems in bipartite... |
DAM
2010
13 years 7 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
ICALP
2010
Springer
14 years 9 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...