Back to Results
First PageMeta Content
Graph theory / NP-complete problems / Graph operations / Graph coloring / Interval graph / Hamiltonian path / Bipartite graph / Ear decomposition / Indifference graph / Chordal graph / Cograph / Strongly chordal graph


An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de
Add to Reading List

Document Date: 2008-11-30 14:19:38


Open Document

File Size: 169,16 KB

Share Result on Facebook