{"id":"https://openalex.org/W2166890675","doi":"https://doi.org/10.1002/net.3230220304","title":"Complexity results for well\u2010covered graphs","display_name":"Complexity results for well\u2010covered graphs","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2166890675","doi":"https://doi.org/10.1002/net.3230220304","mag":"2166890675"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220304","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/A5073093333","display_name":"Ramesh Sankaranarayana","orcid":"https://orcid.org/0000-0002-7001-5369"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ramesh S. Sankaranarayana","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, T6G 2H1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, T6G 2H1","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036977647","display_name":"Lorna Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lorna K. Stewart","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, T6G 2H1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, T6G 2H1","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073093333"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.401,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.89703065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"247","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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.757371187210083},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.755189061164856},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6234594583511353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5796880722045898},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5459399223327637},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5369109511375427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5027098655700684},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.48974013328552246},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4800887703895569},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.47654157876968384},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.44013717770576477},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43454214930534363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4301651120185852},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.42823946475982666},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41991275548934937},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3426050543785095},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25420403480529785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13450577855110168},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12130415439605713}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.757371187210083},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.755189061164856},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6234594583511353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5796880722045898},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5459399223327637},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5369109511375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5027098655700684},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.48974013328552246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4800887703895569},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.47654157876968384},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.44013717770576477},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43454214930534363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4301651120185852},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.42823946475982666},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41991275548934937},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3426050543785095},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25420403480529785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13450577855110168},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12130415439605713}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230220304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220304","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.9278","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.anu.edu.au/~ramesh/./pubs/wcg.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1516831664","https://openalex.org/W1519275474","https://openalex.org/W2011039300","https://openalex.org/W2036243565","https://openalex.org/W2040588665","https://openalex.org/W2041022284","https://openalex.org/W2081611561","https://openalex.org/W2092749268","https://openalex.org/W2131158880","https://openalex.org/W2622381546","https://openalex.org/W4285719527","https://openalex.org/W6673984670"],"related_works":["https://openalex.org/W4213101802","https://openalex.org/W1900138702","https://openalex.org/W4245682093","https://openalex.org/W2017265236","https://openalex.org/W1589992348","https://openalex.org/W2991205486","https://openalex.org/W2041176939","https://openalex.org/W2393701947","https://openalex.org/W2187958446","https://openalex.org/W1988965627"],"abstract_inverted_index":{"Abstract":[0],"A":[1,64],"graph":[2,50,97],"with":[3],"n":[4,30],"vertices":[5],"is":[6,14,52,92],"well":[7,21,73],"covered":[8,22,74],"if":[9,23],"every":[10,24],"maximal":[11,25],"independent":[12,17,26],"set":[13,18,27],"a":[15],"maximum":[16],"and":[19,54],"very":[20,72],"has":[28],"size":[29],"/2.":[31],"In":[32],"this":[33],"work,":[34],"we":[35],"study":[36],"these":[37,67],"graphs":[38],"from":[39],"an":[40],"algorithmic":[41],"complexity":[42],"point":[43],"of":[44,66],"view.":[45],"We":[46],"show":[47],"that":[48,55],"well\u2010covered":[49,62],"recognition":[51],"co\u2010NP\u2010complete":[53],"several":[56],"other":[57],"problems":[58,68],"are":[59],"NP\u2010complete":[60,70],"for":[61,82],"graphs.":[63],"number":[65],"remain":[69],"on":[71],"graphs,":[75],"while":[76],"some":[77],"admit":[78],"polynomial":[79],"time":[80],"solutions":[81],"the":[83,89],"smaller":[84],"class.":[85],"For":[86],"both":[87],"families,":[88],"isomorphism":[90],"problem":[91],"as":[93,95],"hard":[94],"general":[96],"isomorphism.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}