doi:j.aml

First Page		Document Content
Date: 2009-08-17 16:30:24 Interval graph Chordal graph Indifference graph Perfect graph Independent set Circular-arc graph Clique Interval Adjacency matrix Graph Representation Pathwidth		doi:j.aml Add to Reading List Source URL: community.dur.ac.uk Download Document from Source Website File Size: 265,91 KB Share Document on Facebook

	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 DocID: 1qMfK - View Document
	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam DocID: 1qr87 - View Document
	The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2 DocID: 1pX1E - View Document
	The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+ DocID: 1pUII - View Document