乐胖代购免代理版

{"id":"https://openalex.org/W1510083871","doi":"https://doi.org/10.1007/978-3-642-12200-2_4","title":"Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set","display_name":"Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1510083871","doi":"https://doi.org/10.1007/978-3-642-12200-2_4","mag":"1510083871"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12200-2_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5104064156","display_name":"Qian\u2010Ping Gu","orcid":"https://orcid.org/0009-0003-6242-3404"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Qianping Gu","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109044025","display_name":"Navid Imani","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Navid Imani","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6","institution_ids":["https://openalex.org/I18014758"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":3.974,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.883922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"37"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","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":"Graph Theory and Algorithms","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/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.999,"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/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9977,"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/dominating-set","display_name":"Dominating set","score":0.63955474},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.559663},{"id":"https://openalex.org/keywords/constraint-satisfaction-problems","display_name":"Constraint Satisfaction Problems","score":0.513343},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear Programming","score":0.505289},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized Complexity","score":0.503216},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.42144647}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.95784307},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.63955474},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.630273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6222908},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5795926},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5035803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4624304},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.45749718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45022246},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4455531},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4450742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4253805},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.42144647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41613126},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.15878788},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12200-2_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.52,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":29,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1514793018","https://openalex.org/W1517036688","https://openalex.org/W1534129599","https://openalex.org/W1558829011","https://openalex.org/W1589421353","https://openalex.org/W1607068519","https://openalex.org/W1818723348","https://openalex.org/W1850475437","https://openalex.org/W1971799322","https://openalex.org/W1973852671","https://openalex.org/W2006933117","https://openalex.org/W2013415302","https://openalex.org/W2036185701","https://openalex.org/W2064252342","https://openalex.org/W2093762675","https://openalex.org/W2143481064","https://openalex.org/W2148371453","https://openalex.org/W2148556582","https://openalex.org/W2151141289","https://openalex.org/W2171103562","https://openalex.org/W2295665070","https://openalex.org/W2500252975","https://openalex.org/W2501059503","https://openalex.org/W2506178054","https://openalex.org/W2913688336","https://openalex.org/W4243521820","https://openalex.org/W4289255343","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W4384157409","https://openalex.org/W4289285212","https://openalex.org/W2900482350","https://openalex.org/W2662701","https://openalex.org/W2370165438","https://openalex.org/W2357985373","https://openalex.org/W2083586074","https://openalex.org/W2054473698","https://openalex.org/W2009561209","https://openalex.org/W1868459378"],"abstract_inverted_index":{"We":[0],"prove":[1],"a":[2,24,39,78],"small":[3,64],"linear-size":[4],"kernel":[5,40],"for":[6],"the":[7,53,57,61,70,88],"connected":[8,32,72],"dominating":[9,33,73],"set":[10,19],"problem":[11],"in":[12,48],"planar":[13,25,71],"graphs":[14],"through":[15],"data":[16],"reduction.":[17],"Our":[18,75],"of":[20,41,55,63,69,81],"rules":[21],"efficiently":[22],"reduce":[23],"graph":[26],"G":[27],"with":[28],"n":[29],"vertices":[30],"and":[31],"number":[34],"\u03b3":[35],"c":[36,46],"(G)":[37,47],"to":[38],"size":[42],"at":[43],"most":[44],"413\u03b3":[45],"O(n":[49],"3)":[50],"time":[51,82],"answering":[52],"question":[54],"whether":[56],"connectivity":[58],"criteria":[59],"hinders":[60],"construction":[62],"kernels,":[65],"negatively":[66],"(in":[67],"case":[68],"set).":[74],"result":[76],"gives":[77],"fixed-parameter":[79],"algorithm":[80],"$(2^{O(\\sqrt{\\gamma_c(G)})}\\cdot":[83],"\\gamma_c(G)":[84],"+":[85],"n^3)$":[86],"using":[87],"standard":[89],"branch-decomposition":[90],"based":[91],"approach.":[92]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1510083871","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2024-11-30T15:58:40.791421","created_date":"2016-06-24"}