{"id":"https://openalex.org/W2052850644","doi":"https://doi.org/10.1002/net.3230030305","title":"Algorithms for a maximum clique and a maximum independent set of a circle graph","display_name":"Algorithms for a maximum clique and a maximum independent set of a circle graph","publication_year":1973,"publication_date":"1973-01-01","ids":{"openalex":"https://openalex.org/W2052850644","doi":"https://doi.org/10.1002/net.3230030305","mag":"2052850644"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230030305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230030305","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/A5078313840","display_name":"F\u01cenic\u01ce Gavril","orcid":"https://orcid.org/0000-0001-9584-2232"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"F. Gavril","raw_affiliation_strings":["The Weizmann Institute of Science Rehovot, Israel","The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Weizmann Institute of Science Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078313840"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":1.0657,"has_fulltext":false,"cited_by_count":175,"citation_normalized_percentile":{"value":0.769132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"3","issue":"3","first_page":"261","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9988999962806702,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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/combinatorics","display_name":"Combinatorics","score":0.7904559373855591},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.6558775901794434},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6062849164009094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.564037024974823},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5568102598190308},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5232447981834412},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.48929664492607117},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47751346230506897},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.4768356382846832},{"id":"https://openalex.org/keywords/chord","display_name":"Chord (peer-to-peer)","score":0.4754447937011719},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43383505940437317},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4049984812736511},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39733651280403137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3218158185482025},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2870933711528778},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.276050865650177},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.26040565967559814},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1827266812324524}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7904559373855591},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.6558775901794434},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6062849164009094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.564037024974823},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5568102598190308},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5232447981834412},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.48929664492607117},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47751346230506897},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.4768356382846832},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.4754447937011719},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43383505940437317},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4049984812736511},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39733651280403137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3218158185482025},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2870933711528778},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.276050865650177},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.26040565967559814},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1827266812324524},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230030305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230030305","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W45625111","https://openalex.org/W1517921658","https://openalex.org/W1973310391","https://openalex.org/W2022971294","https://openalex.org/W2035331304","https://openalex.org/W2063410295","https://openalex.org/W2089465933"],"related_works":["https://openalex.org/W4213050588","https://openalex.org/W1783742161","https://openalex.org/W2133128623","https://openalex.org/W2044762907","https://openalex.org/W2097999883","https://openalex.org/W4232461730","https://openalex.org/W2090708733","https://openalex.org/W1965463345","https://openalex.org/W1819739797","https://openalex.org/W2021754931"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,7,19,42,46],"family":[3],"of":[4,50,65],"chords":[5,31],"in":[6,67],"circle.":[8],"A":[9],"circle":[10,51],"graph":[11],"is":[12,62],"obtained":[13],"by":[14,18,25],"representing":[15],"each":[16],"chord":[17],"vertex,":[20],"two":[21],"vertices":[22,66],"being":[23],"connected":[24],"an":[26],"edge":[27],"when":[28],"the":[29,63,68],"corresponding":[30],"intersect.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36],"describe":[37],"efficient":[38],"algorithms":[39,54],"for":[40],"finding":[41],"maximum":[43,47],"clique":[44],"and":[45],"independent":[48],"set":[49],"graphs.":[52],"These":[53],"require":[55],"at":[56],"most":[57],"n3":[58],"steps,":[59],"where":[60],"n":[61],"number":[64],"graph.":[69]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}