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 - Hamiltonian path - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-11-30 14:19:38 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 Source URL: community.dur.ac.uk Download Document from Source Website File Size: 169,16 KB Share Document on Facebook

	arXiv:submitmath.CO] 25 MayOn edges not in monochromatic copies of a fixed bipartite graph Jie Ma∗ Abstract DocID: 1v3xG - View Document
	Radio Resource Sharing for MTC in LTE-A: An Interference-Aware Bipartite Graph Approach Safa Hamdoun, Abderrezak Rachedi, Yacine Ghamri-Doudane To cite this version: Safa Hamdoun, Abderrezak Rachedi, Yacine Ghamri-Doudan DocID: 1t6Yp - View Document
	Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that DocID: 1sjuw - View Document
	Spectral Graph Theory Lecture 26 Bipartite Ramanujan Graphs of Every Degree Daniel A. Spielman DocID: 1rNPK - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document