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

	Vertex splitting and the recognition of trapezoid graphs DocID: 1rrEL - View Document
	Polydisperse spherical cap packings David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin Optimal and near optimal configurations on lattices and manifolds Oberwolfach - August 24, 2012 DocID: 1r7Cy - View Document
	Incremental Specialization of an HPSG-Based Annotation Scheme Kiril Simov, Milen Kouylekov, Alexander Simov BulTreeBank Project http://www.BulTreeBank.org Linguistic Modelling Laboratory, Bulgarian Academy of Sciences Ac DocID: 1qS49 - View Document
	Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany. DocID: 1qL0N - View Document