Show simple item record

dc.contributor.authorOdom, Richard M.
dc.contributor.authorRasmussen, Craig W.
dc.date.accessioned2013-08-12T17:55:09Z
dc.date.available2013-08-12T17:55:09Z
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/10945/35032
dc.description.abstractIf G = (F, E) i8 a 8irnple graph of order n and 8iz.e q, and if P is a property held by C, Lhen a. P-compleLion 8equence for G is an ordering t 1 , e2 , ... , e("~)-q of Lhe edges of K,, - G such that Ch= ( v, /",~ + u-~, e,) has propprty p for Pach k = 1: '.Z, ... ' (;) - q. \VP add thP stronp;ly chordal graphs to Lhe 8el of dasse8 for which such 8equence8 are known Lo exisL, and 8how Lha.L ?completion sequences for these and several other subclasses of the chordal graphs can be constructed in polynomial time. In most cases we exploit the corresponding vertex elimination orderings.en_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleConditional Completion Algorithms for Classes of Chordal Graphsen_US
dc.contributor.departmentApplied Mathematics


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record