On some simplicial elimination schemes for chordal graphs

Simple item page
dc.creatorHabib, Michel
dc.creatorLimouzy, Vincent
dc.date2009-01-17
dc.date2009-02-17
dc.date.accessioned2026-07-07T12:42:01Z
dc.date.available2026-07-07T12:42:01Z
dc.descriptionWe present here some results on particular elimination schemes for chordal graphs, namely we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal separator maximal (resp. minimal) under inclusion among all minimal separators.
dc.identifierhttps://arxiv.org/abs/0901.2645
dc.identifierhttp://arxiv.org/abs/0901.2645
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219937
dc.subjectData Structures and Algorithms
dc.titleOn some simplicial elimination schemes for chordal graphs
dc.typetext

Files

Collections

arXiv