K-best Cuts for Circular-arc Graphs

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/39665

Title:	K-best Cuts for Circular-arc Graphs
Authors:	Tsai, K. H. Lee, D. T.
Issue Date:	1997-06
Relation:	Algorithmica 18, 198-216
URI:	http://ir.sinica.edu.tw/handle/201000000A/39665
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0178-4617&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	資訊科學研究所

Show full item record

checked on Dec 31, 2022

Check