![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Bhattacharya B.K. Kaller D.
Publisher: Academic Press
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.25, Iss.2, 1997-11, pp. : 336-358
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum Fill-in on Circle and Circular-Arc Graphs
By Kloks T. Kratsch D. Wong C.K.
Journal of Algorithms, Vol. 28, Iss. 2, 1998-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Phased local search for the maximum clique problem
By Pullan Wayne
Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. :