C: Users Oliver Dropbox Andrea-Bang-Oliver split-vs-set-representation 3-sun-free-split-rootsdvi - Set operations - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-02-02 16:29:21 Graph operations Graph coloring Chordal graph Line graph Split graph Clique Forbidden graph characterization Neighbourhood Pathwidth Strongly chordal graph		C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi Add to Reading List Source URL: www.zaik.uni-koeln.de Download Document from Source Website File Size: 175,51 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
	Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios · DocID: 1ppRS - View Document
	C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi DocID: 1kCsX - View Document
	Studies on Subgraph and Supergraph Enumeration Algorithms Masashi Kiyomi DOCTOR OF DocID: 15nlm - View Document
	NPS-MA[removed]NAVAL POSTGRADUATE SCHOOL Monterey, California A Partial Ordering of the Chordal Graphs DocID: q1zt - View Document