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 - Emden - 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

	Prof. Dr. Petra Scheffler FH Stralsund, FB Wirtschaft Wissenschaftliche Vorträge DocID: 1rsjv - View Document
	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont DocID: 1rlxP - View Document
	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ DocID: 1rf09 - View Document
	Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick DocID: 1r7Hx - View Document
	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School DocID: 1qQA2 - View Document