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 - Terry de la Mesa Allen, Sr. - 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

	Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract DocID: 1rg2z - View Document
	Aachen Department of Computer Science Technical Report Better termination proving through cooperation DocID: 1rezO - View Document
	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1 DocID: 1qTAq - 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
	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