The path partition problem and related problems in bipartite graphs

13 years 4 months ago

Download www.lamsade.dauphine.fr

We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.

Jérôme Monnot, Sophie Toulouse

Real-time Traffic

Bipartite Graph | Maximum Degree | Nk Vertices | ORL 2007 |

claim paper

» On the complexity of finding chordless paths in bipartite graphs and some interval operato...

» A counterexample to the AlonSaksSeymour conjecture and related problems

» Solving cluster ensemble problems by bipartite graph partitioning

» Subgraph Isomorphism in Planar Graphs and Related Problems

» Coclustering documents and words using bipartite spectral graph partitioning

» The Link Prediction Problem in Bipartite Networks

» Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Re...

» Coclustering Documents and Words by Minimizing the Normalized Cut Objective Function

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	ORL
Authors	Jérôme Monnot, Sophie Toulouse

Comments (0)

Sciweavers

The path partition problem and related problems in bipartite graphs

Bipartite Graph | Maximum Degree | Nk Vertices | ORL 2007 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers