{"id":"https://openalex.org/W1964910584","doi":"https://doi.org/10.1137/s0895480193244322","title":"<i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs","display_name":"<i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W1964910584","doi":"https://doi.org/10.1137/s0895480193244322","mag":"1964910584"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480193244322","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480193244322","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5110641666","display_name":"Shiow-Fen Hwang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shiow-Fen Hwang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002508116","display_name":"Gerard J. Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerard J. Chang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.10181434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"4","first_page":"633","last_page":"643"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9914000034332275,"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.9894000291824341,"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.8644968271255493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8155418634414673},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.813264787197113},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7058006525039673},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.6833057403564453},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5112371444702148},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47152218222618103},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45488667488098145},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4405277967453003},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4216092824935913},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1427299976348877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.051640063524246216}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8644968271255493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8155418634414673},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.813264787197113},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7058006525039673},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.6833057403564453},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5112371444702148},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47152218222618103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45488667488098145},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4405277967453003},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4216092824935913},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1427299976348877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.051640063524246216},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480193244322","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480193244322","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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":15,"referenced_works":["https://openalex.org/W1968148694","https://openalex.org/W1976427966","https://openalex.org/W2012550027","https://openalex.org/W2019034047","https://openalex.org/W2022548094","https://openalex.org/W2025275119","https://openalex.org/W2055841009","https://openalex.org/W2060194144","https://openalex.org/W2063906290","https://openalex.org/W2068361557","https://openalex.org/W2072141822","https://openalex.org/W2083371178","https://openalex.org/W2084535093","https://openalex.org/W2143474538","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W4387499021","https://openalex.org/W4238032972","https://openalex.org/W1968027460","https://openalex.org/W1608132493","https://openalex.org/W1492613353","https://openalex.org/W2103423788","https://openalex.org/W1811247372","https://openalex.org/W4297060651","https://openalex.org/W2014928604","https://openalex.org/W2255926633"],"abstract_inverted_index":{"Suppose":[0],"G=(V,E)":[1],"is":[2,8,30,42,52,118],"a":[3,9,31,53,93,98,103,108,114],"simple":[4],"graph":[5,111],"and":[6,23,81,102],"k":[7],"fixed":[10],"positive":[11],"integer.":[12],"A":[13,27,49],"vertex":[14,46,69],"zk-neighborhood-covers":[15],"an":[16],"edge":[17,39],"(x,y)":[18],"if":[19],"d(z,x)":[20],"\\leq":[21,25],"k$":[22],"d(z,y)":[24],"k$.":[26],"k-neighborhood-covering":[28,80,100],"set":[29,32,51,54,101,106],"C":[33],"of":[34,55],"vertices":[35],"such":[36],"that":[37,78,113],"every":[38],"in":[40,47,57,70,120],"E":[41],"k-neighborhood-covered":[43,65],"by":[44,66],"some":[45],"C.":[48],"k-neighborhood-independent":[50,105],"edges":[56,62],"which":[58],"no":[59],"two":[60],"distinct":[61],"can":[63],"be":[64],"the":[67,79,82],"same":[68],"V.":[71],"In":[72],"this":[73],"paper":[74],"we":[75],"first":[76],"prove":[77],"k-neighborhood-independence":[83],"problems":[84],"are":[85],"NP-complete":[86],"for":[87,96,107],"chordal":[88,110],"graphs.":[89],"We":[90],"then":[91],"present":[92],"linear-time":[94],"algorithm":[95],"finding":[97],"minimum":[99],"maximum":[104],"strongly":[109],"provided":[112],"strong":[115],"elimination":[116],"ordering":[117],"given":[119],"advance.":[121]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}