Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time

First Page		Document Content
Date: 2011-12-14 14:46:08 NP-complete problems Circular-arc graph Longest path problem Hamiltonian path Interval graph Intersection graph Independent set Graph theory Pathwidth Trapezoid graph		Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Add to Reading List Source URL: community.dur.ac.uk Download Document from Source Website File Size: 178,60 KB Share Document on Facebook

	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam DocID: 1qr87 - View Document
	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time DocID: 1pIzb - View Document
	doi:j.aml DocID: 1pbNL - View Document