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

	Interactive activity – Lines and bars graph www.webardora.net Activity where we can create a line or a bar graph and also perform several operations on the same data table, etc: DocID: 1uVcL - View Document
	Coordinate Geometry: Straight Lines & Circles Straight lines A. Some basic operations (i) Entering an equation in ‘GRAPH’ mode Example: DocID: 1sag4 - View Document
	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer DocID: 1rrUb - View Document
	Vertex splitting and the recognition of trapezoid graphs DocID: 1rrEL - View Document
	g2o: A General Framework for Graph Optimization Rainer K¨ummerle Giorgio Grisetti Hauke Strasdat DocID: 1rqHa - View Document