{"id":"https://openalex.org/W1993489705","doi":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","title":"Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs","display_name":"Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W1993489705","doi":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","mag":"1993489705"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5102758281","display_name":"S. Q. Zheng","orcid":"https://orcid.org/0000-0002-5773-0341"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Q. Zheng","raw_affiliation_strings":["Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana 70803"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana 70803","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102758281"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13054187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"1","first_page":"15","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6865605115890503},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6674066185951233},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6391276121139526},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.608252763748169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5830649137496948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5497116446495056},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5306013226509094},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5274810194969177},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.44975394010543823},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.43526050448417664},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43105295300483704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4170180559158325},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3893655836582184},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29773828387260437},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.17037975788116455},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09291213750839233}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6865605115890503},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6674066185951233},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6391276121139526},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.608252763748169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5830649137496948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5497116446495056},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5306013226509094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5274810194969177},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.44975394010543823},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.43526050448417664},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43105295300483704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4170180559158325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3893655836582184},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29773828387260437},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.17037975788116455},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09291213750839233},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W3030122542","https://openalex.org/W1963654174","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2057124519","https://openalex.org/W1966320878","https://openalex.org/W2133859997","https://openalex.org/W1967643201","https://openalex.org/W2289857770"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,23,30],"simple":[3],"optimal":[4],"algorithm":[5,28,69],"for":[6],"the":[7,49,62,65,68,73],"problem":[8],"of":[9,14,22,34,51,61,67],"finding":[10],"maximum":[11,31],"independent":[12,32],"sets":[13],"circular-arc":[15,24,84],"graphs.":[16],"Given":[17],"an":[18],"intersection":[19],"model":[20],"S":[21,54],"graph":[25],"G,":[26],"our":[27],"computes":[29],"set":[33],"G":[35],"in":[36,53],"O(n)":[37,40],"space":[38],"and":[39,64,72],"or":[41,57],"O(n":[42],"log":[43],"n)":[44],"time,":[45],"depending":[46],"on":[47,83],"whether":[48],"endpoints":[50],"arcs":[52],"are":[55,70],"sorted":[56],"not.":[58],"The":[59],"proofs":[60],"correctness":[63],"complexities":[66],"straightforward,":[71],"techniques":[74],"used":[75],"can":[76],"be":[77],"generalized":[78],"to":[79],"solve":[80],"other":[81],"problems":[82],"graphs":[85],"efficiently.":[86],"\u00a9":[87],"1996":[88],"John":[89],"Wiley":[90],"&":[91],"Sons,":[92],"Inc.":[93]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}