Minimum fill-in on circle and circular-arc graphs

T. Kloks, D. Kratsch, C.K. Wong

Research output: Contribution to journalArticleAcademic

27 Citations (Scopus)

Abstract

We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3)
Original languageUndefined
Pages (from-to)272-289
JournalJournal of algorithms
Volume28
Issue number2
DOIs
Publication statusPublished - 1998

Keywords

  • IR-73828

Cite this