Minimum fill-in on circle and circular-arc graphs

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

doi:10.1006/jagm.1998.0936

Minimum fill-in on circle and circular-arc graphs

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

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic

37 Citations (Scopus)

19 Downloads (Pure)

Abstract

We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3)

Original language	Undefined
Pages (from-to)	272-289
Journal	Journal of algorithms
Volume	28
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1998.0936
Publication status	Published - 1998

Keywords

IR-73828

Access to Document

10.1006/jagm.1998.0936

Cite this

@article{43b664ef208849219ce49db45cf9a715,

title = "Minimum fill-in on circle and circular-arc graphs",

abstract = "We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3)",

keywords = "IR-73828",

author = "T. Kloks and D. Kratsch and C.K. Wong",

year = "1998",

doi = "10.1006/jagm.1998.0936",

language = "Undefined",

volume = "28",

pages = "272--289",

journal = "Journal of algorithms",

issn = "0196-6774",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - Minimum fill-in on circle and circular-arc graphs

AU - Kloks, T.

AU - Kratsch, D.

AU - Wong, C.K.

PY - 1998

Y1 - 1998

N2 - We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3)

AB - We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3)

KW - IR-73828

U2 - 10.1006/jagm.1998.0936

DO - 10.1006/jagm.1998.0936

M3 - Article

SN - 0196-6774

VL - 28

SP - 272

EP - 289

JO - Journal of algorithms

JF - Journal of algorithms

IS - 2

ER -