{"id":"https://openalex.org/W1973146956","doi":"https://doi.org/10.1137/0219071","title":"Minimum Cuts for Circular-Arc Graphs","display_name":"Minimum Cuts for Circular-Arc Graphs","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W1973146956","doi":"https://doi.org/10.1137/0219071","mag":"1973146956"},"language":"en","primary_location":{"id":"doi:10.1137/0219071","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219071","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091498493","display_name":"D. T. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. T. Lee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078132977","display_name":"Majid Sarrafzadeh","orcid":"https://orcid.org/0000-0001-8407-8689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Sarrafzadeh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101415333","display_name":"Yezhou Wu","orcid":"https://orcid.org/0000-0001-9608-6942"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y. F. Wu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091498493"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4139,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.83138367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"6","first_page":"1041","last_page":"1050"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7784404754638672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7215800285339355},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5679033994674683},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5003745555877686},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.48136645555496216},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48132002353668213},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.4625617265701294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43786224722862244},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4322393834590912},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42372629046440125},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4164380729198456},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38764235377311707},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12237125635147095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1189466118812561},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08682382106781006}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7784404754638672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7215800285339355},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5679033994674683},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5003745555877686},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.48136645555496216},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48132002353668213},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.4625617265701294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43786224722862244},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4322393834590912},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42372629046440125},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4164380729198456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38764235377311707},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12237125635147095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1189466118812561},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08682382106781006},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0219071","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219071","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1998932824","https://openalex.org/W2071867466","https://openalex.org/W2089661627","https://openalex.org/W2111890199"],"related_works":["https://openalex.org/W2075840509","https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W2143180579","https://openalex.org/W2063227364","https://openalex.org/W1711136171","https://openalex.org/W1483891445","https://openalex.org/W2907472296","https://openalex.org/W2952007966","https://openalex.org/W4301505556"],"abstract_inverted_index":{"The":[0,55],"problem":[1,21,48,61,71,80],"of":[2,7,42,85,101,124],"finding":[3],"a":[4,11,36,67,76,86,90],"minimum":[5,59,68,77],"cut":[6,60],"n":[8,102],"arcs":[9,44,103],"on":[10],"unit":[12],"circle":[13,87],"is":[14,17,32,93,116],"considered.":[15],"It":[16],"shown":[18,95],"that":[19,96],"this":[20],"can":[22,49,62,104],"be":[23,50,63,105],"solved":[24,51],"in":[25,52,72,107],"$\\Theta":[26],"(n":[27],"\\log":[28],"n)$":[29],"time,":[30,109],"which":[31,115],"optimal":[33],"to":[34,57,65],"within":[35],"constant":[37],"factor.":[38],"If":[39],"the":[40,43,47,58,82,97,111,120],"endpoints":[41,112],"are":[45,113],"sorted,":[46,114],"linear":[53,108],"time.":[54],"solution":[56],"used":[64],"solve":[66],"new":[69],"facility":[70],"competitive":[73],"location":[74],"and":[75,126],"partition":[78],"set":[79,100],"for":[81],"intersection":[83],"model":[84],"graph.":[88],"As":[89],"by-product":[91],"it":[92],"also":[94],"maximum":[98],"independent":[99],"obtained":[106],"assuming":[110],"much":[117],"simpler":[118],"than":[119],"most":[121],"recent":[122],"result":[123],"Masuda":[125],"Nakajima":[127],"[SIAMI.":[128],"Comput.,":[129],"17":[130],"(1988),":[131],"pp.":[132],"41\u201352].":[133]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}