{"id":"https://openalex.org/W3138131651","doi":"https://doi.org/10.3390/a14040105","title":"A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2","display_name":"A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2","publication_year":2021,"publication_date":"2021-03-25","ids":{"openalex":"https://openalex.org/W3138131651","doi":"https://doi.org/10.3390/a14040105","mag":"3138131651"},"language":"en","primary_location":{"id":"doi:10.3390/a14040105","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040105","pdf_url":"https://www.mdpi.com/1999-4893/14/4/105/pdf?version=1616748415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/4/105/pdf?version=1616748415","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090907237","display_name":"Serafino Cicerone","orcid":"https://orcid.org/0000-0001-8893-9335"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Serafino Cicerone","raw_affiliation_strings":["Department of Information Engineering, Computer Science and Mathematics, University of L\u2019Aquila, I-67100 L\u2019Aquila, Italy","Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, I-67100 L'Aquila, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Computer Science and Mathematics, University of L\u2019Aquila, I-67100 L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, I-67100 L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090907237"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2959,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58616995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"14","issue":"4","first_page":"105","last_page":"105"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9995999932289124,"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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7201526761054993},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5698659420013428},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5465861558914185},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5148233771324158},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5087166428565979},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49794602394104004},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4677906930446625},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4621501564979553},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.42077183723449707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.360801100730896},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3001058101654053},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.29150986671447754}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7201526761054993},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5698659420013428},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5465861558914185},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5148233771324158},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5087166428565979},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49794602394104004},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4677906930446625},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4621501564979553},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42077183723449707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.360801100730896},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3001058101654053},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.29150986671447754},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14040105","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040105","pdf_url":"https://www.mdpi.com/1999-4893/14/4/105/pdf?version=1616748415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:09180fdcc2144c0e860cfe602fdf8d66","is_oa":true,"landing_page_url":"https://doaj.org/article/09180fdcc2144c0e860cfe602fdf8d66","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 4, p 105 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/4/105/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14040105","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 4; Pages: 105","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14040105","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040105","pdf_url":"https://www.mdpi.com/1999-4893/14/4/105/pdf?version=1616748415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3138131651.pdf","grobid_xml":"https://content.openalex.org/works/W3138131651.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1270887182","https://openalex.org/W1520885470","https://openalex.org/W1538699184","https://openalex.org/W1546500602","https://openalex.org/W1579049696","https://openalex.org/W1746286871","https://openalex.org/W1981356557","https://openalex.org/W1994706865","https://openalex.org/W2000275001","https://openalex.org/W2001702651","https://openalex.org/W2010142297","https://openalex.org/W2041910029","https://openalex.org/W2059518216","https://openalex.org/W2073043470","https://openalex.org/W2079306871","https://openalex.org/W2081121429","https://openalex.org/W3014185535","https://openalex.org/W3019251218","https://openalex.org/W6775440788"],"related_works":["https://openalex.org/W3130332934","https://openalex.org/W1977862280","https://openalex.org/W2169699292","https://openalex.org/W1946718366","https://openalex.org/W1971319751","https://openalex.org/W2031276298","https://openalex.org/W2949743119","https://openalex.org/W2061237693","https://openalex.org/W2898526288","https://openalex.org/W2083238533"],"abstract_inverted_index":{"Cicerone":[0],"and":[1,5,91],"Di":[2],"Stefano":[3],"defined":[4,34],"studied":[6],"the":[7,15,27,30,40,60,70,74,112,117],"class":[8,71],"of":[9,39,62,72,87,107,119],"k-distance-hereditary":[10,75],"graphs,":[11,44],"i.e.,":[12],"graphs":[13,35,65,76],"where":[14],"distance":[16,28],"in":[17,29,59,85,121],"each":[18],"connected":[19],"induced":[20],"subgraph":[21],"is":[22],"at":[23],"most":[24],"k":[25],"times":[26],"whole":[31],"graph.":[32,124],"The":[33,80],"represent":[36],"a":[37,56,100],"generalization":[38],"well":[41],"known":[42],"distance-hereditary":[43],"which":[45],"actually":[46],"correspond":[47],"to":[48,98,111],"1-distance-hereditary":[49],"graphs.":[50],"In":[51],"this":[52,105],"paper":[53],"we":[54],"make":[55],"step":[57],"forward":[58],"study":[61],"these":[63],"new":[64,81],"by":[66],"providing":[67],"characterizations":[68,82],"for":[69,104],"all":[73],"such":[77],"that":[78],"k<2.":[79],"are":[83],"given":[84,123],"terms":[86],"both":[88],"forbidden":[89],"subgraphs":[90],"cycle-chord":[92],"properties.":[93],"Such":[94],"results":[95],"also":[96],"lead":[97],"devise":[99],"polynomial-time":[101],"recognition":[102],"algorithm":[103],"kind":[106],"graph":[108],"that,":[109],"according":[110],"provided":[113],"characterizations,":[114],"simply":[115],"detects":[116],"presence":[118],"quasi-holes":[120],"any":[122]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}