Interval graphs and seatching

Kirousis, LM; Papadimitriou, CH

dc.contributor.author	Kirousis, LM	en
dc.contributor.author	Papadimitriou, CH	en
dc.date.accessioned	2014-03-01T01:06:26Z
dc.date.available	2014-03-01T01:06:26Z
dc.date.issued	1985	en
dc.identifier.issn	0012-365X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9373
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0000288138&partnerID=40&md5=f598688f8acf940f784fe11cc67435d6	en
dc.subject.classification	Mathematics	en
dc.title	Interval graphs and seatching	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1985	en
heal.abstract	The interval thickness of a graph G is the minimum clique number over any interval supergraph of G. The node-search number is the least number of searchers required to clear the 'contaminated' edges of a graph. The clearing is accomplished by concurrently having searchers on both of its endpoints. We prove that for any graph, these two parameters coincide. © 1985.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Discrete Mathematics	en
dc.identifier.isi	ISI:A1985APF4200008	en
dc.identifier.volume	55	en
dc.identifier.issue	2	en
dc.identifier.spage	181	en
dc.identifier.epage	184	en