|
|||||
|
|
Minimum Fill-in on Circle and Circular-Arc Graphs |
|
| Authors: | T Kloks D Kratsch CK Wong |
| Institution: | aFaculty of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands;bFakultät für Mathematik und Informatik, Friedrich-Schiller-Universität, 07740, Jena, Germany;cDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong |
| Abstract: | We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in timeO(n3). |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |