乐胖代购免代理版

{"id":"https://openalex.org/W2557477110","doi":"https://doi.org/10.1016/j.akcej.2016.11.008","title":"New graph classes characterized by weak vertex separators and two-pairs","display_name":"New graph classes characterized by weak vertex separators and two-pairs","publication_year":2016,"publication_date":"2016-12-02","ids":{"openalex":"https://openalex.org/W2557477110","doi":"https://doi.org/10.1016/j.akcej.2016.11.008","mag":"2557477110"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.akcej.2016.11.008","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1016/j.akcej.2016.11.008","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018454433","display_name":"Terry A. McKee","orcid":"https://orcid.org/0000-0003-0745-6716"},"institutions":[{"id":"https://openalex.org/I19648265","display_name":"Wright State University","ror":"https://ror.org/04qk6pt94","country_code":"US","type":"education","lineage":["https://openalex.org/I19648265"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Terry A. McKee","raw_affiliation_strings":["Department of Mathematics & Statistics, Wright State University, Dayton, OH 45435, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Statistics, Wright State University, Dayton, OH 45435, USA","institution_ids":["https://openalex.org/I19648265"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018454433"],"corresponding_institution_ids":["https://openalex.org/I19648265"],"apc_list":{"value":1000,"currency":"GBP","value_usd":1226,"provenance":"doaj"},"apc_paid":{"value":1000,"currency":"GBP","value_usd":1226,"provenance":"doaj"},"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":66},"biblio":{"volume":"14","issue":"1","first_page":"13","last_page":"17"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9999,"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.9999,"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.9967,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926,"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/induced-subgraph","display_name":"Induced subgraph","score":0.6447628},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.44612566}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8844989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7721569},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6447628},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6420897},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5581925},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.44612566},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41602746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41261336},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.akcej.2016.11.008","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":false,"landing_page_url":"https://doaj.org/article/59af05e34fce42b09c1590e1ee104fcd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.akcej.2016.11.008","pdf_url":null,"source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W112858196","https://openalex.org/W2018127313","https://openalex.org/W2041910029","https://openalex.org/W2043759134","https://openalex.org/W2075989463","https://openalex.org/W2081938755","https://openalex.org/W2082068582","https://openalex.org/W2148759423","https://openalex.org/W2204761152","https://openalex.org/W2402648100","https://openalex.org/W2952096650","https://openalex.org/W4230526896"],"related_works":["https://openalex.org/W4383700488","https://openalex.org/W4290190164","https://openalex.org/W4286911546","https://openalex.org/W4248744973","https://openalex.org/W3037015124","https://openalex.org/W3021699323","https://openalex.org/W2902222102","https://openalex.org/W2626844239","https://openalex.org/W2133919704","https://openalex.org/W2065410741"],"abstract_inverted_index":{"A":[0],"set":[1],"of":[2,23,48,52,66,70,75,95],"vertices":[3,16,27,65],"whose":[4],"deletion":[5],"from":[6],"a":[7,19,29,53,57],"graph":[8,54,99],"would":[9],"increase":[10],"the":[11,24,96,105],"distance":[12],"between":[13,35],"two":[14],"remaining":[15],"is":[17,79],"called":[18],"weak":[20,45],"vertex":[21,46],"separator":[22,47],"graph.":[25],"Two":[26],"form":[28,73],"two-pair":[30],"if":[31,60,63],"all":[32],"chordless":[33],"paths":[34],"them":[36],"have":[37],"length":[38],"2.":[39],"I":[40],"prove":[41],"that":[42],"every":[43,49],"inclusion-minimal":[44],"induced":[50,67],"subgraph":[51,59],"G":[55,71],"induces":[56],"complete":[58],"and":[61,84,90,104,115],"only":[62],"nonadjacent":[64],"C4":[68,85],"subgraphs":[69],"always":[72],"two-pairs":[74],"G;":[76],"moreover,":[77],"this":[78],"also":[80],"true":[81],"when":[82],"\u201ccomplete\u201d":[83],"are":[86],"replaced":[87],"with":[88],"\u201cedgeless\u201d":[89],"K4\u2212e":[91],"(\u2245K1,1,2).":[92],"The":[93],"first":[94],"resulting":[97],"new":[98],"classes":[100],"generalizes":[101,107],"chordal":[102],"graphs,":[103],"second":[106],"unichord-free":[108],"graphs;":[109],"they":[110],"both":[111],"generalize":[112],"distance-hereditary":[113],"graphs":[114],"geodetic":[116],"graphs.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2557477110","counts_by_year":[],"updated_date":"2024-12-12T16:12:41.966638","created_date":"2016-12-08"}