Publication
Journal of Algorithms
Paper
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 time O(n3). © 1998 Academic Press.
We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in time O(n3). © 1998 Academic Press.