乐胖代购免代理版

{"id":"https://openalex.org/W2143368979","doi":"https://doi.org/10.7155/jgaa.00141","title":"Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems","display_name":"Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2143368979","doi":"https://doi.org/10.7155/jgaa.00141","mag":"2143368979"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00141","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_indexed_in_scopus":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00141","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025441020","display_name":"Kerri Morgan","orcid":"https://orcid.org/0000-0002-7263-8340"},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kerri Morgan","raw_affiliation_strings":["Monash university"],"affiliations":[{"raw_affiliation_string":"Monash university","institution_ids":["https://openalex.org/I2801239119"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005637509","display_name":"Graham Farr","orcid":null},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Graham Farr","raw_affiliation_strings":["Monash university"],"affiliations":[{"raw_affiliation_string":"Monash university","institution_ids":["https://openalex.org/I2801239119"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"USD","value_usd":0},"apc_paid":null,"fwci":1.247,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":9,"citation_normalized_percentile":{"value":0.907149,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":82,"max":83},"biblio":{"volume":"11","issue":"1","first_page":"165","last_page":"193"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9992,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.49696496}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7308686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5361886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5135291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49815512},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.49696496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37125462},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32333022},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1878891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09983614},{"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00141","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_indexed_in_scopus":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://figshare.com/articles/report/Approximation_Algorithms_for_the_Maximum_Induced_Planar_and_Outerplanar_Subgraph_Problems/20365404","pdf_url":"https://figshare.com/articles/report/Approximation_Algorithms_for_the_Maximum_Induced_Planar_and_Outerplanar_Subgraph_Problems/20365404/1/files/36404499.pdf","source":{"id":"https://openalex.org/S4306400572","display_name":"OPAL (Open@LaTrobe) (La Trobe University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I196829312","host_organization_name":"La Trobe University","host_organization_lineage":["https://openalex.org/I196829312"],"host_organization_lineage_names":["La Trobe University"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://hdl.handle.net/10536/DRO/DU:30107617","pdf_url":"https://dro.deakin.edu.au/articles/journal_contribution/Approximation_algorithms_for_the_maximum_induced_planar_and_outerplanar_subgraph_problems/20812390/2/files/37069834.pdf","source":{"id":"https://openalex.org/S4306402457","display_name":"Deakin Research Online (Deakin University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":["Deakin University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00141","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_indexed_in_scopus":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1581592080","https://openalex.org/W1592213313","https://openalex.org/W1964524846","https://openalex.org/W1992709202","https://openalex.org/W1994333286","https://openalex.org/W2005080287","https://openalex.org/W2038643780","https://openalex.org/W2045027193","https://openalex.org/W2052400534","https://openalex.org/W2068871408","https://openalex.org/W2071177062","https://openalex.org/W2077213922","https://openalex.org/W2078391137","https://openalex.org/W2091476183","https://openalex.org/W2111635834","https://openalex.org/W2155537964","https://openalex.org/W2163269124","https://openalex.org/W2168320078","https://openalex.org/W4242102268","https://openalex.org/W4251875563"],"related_works":["https://openalex.org/W3119883127","https://openalex.org/W2789779990","https://openalex.org/W2566114558","https://openalex.org/W2386767533","https://openalex.org/W2081165457","https://openalex.org/W2079220110","https://openalex.org/W2032104747","https://openalex.org/W2024201669","https://openalex.org/W1978042415","https://openalex.org/W1963552444"],"abstract_inverted_index":{"The":[0],"task":[1],"of":[2,7,9,38,42,45,68,88],"finding":[3,60],"the":[4,20,43,111],"largest":[5],"subset":[6],"vertices":[8,85,90],"a":[10,14],"graph":[11],"that":[12,103],"induces":[13],"planar":[15],"subgraph":[16,78],"is":[17,71],"known":[18],"as":[19],"Maximum":[21],"Induced":[22],"Planar":[23],"Subgraph":[24],"problem":[25],"(MIPS).In":[26],"this":[27,100],"paper,":[28],"some":[29],"new":[30],"approximation":[31,50],"algorithms":[32,51,58,70,106],"for":[33,59,86],"MIPS":[34,49],"are":[35,56,65],"introduced.The":[36],"results":[37,97],"an":[39,75],"extensive":[40],"study":[41],"performance":[44],"these":[46,69],"and":[47],"existing":[48,105,112],"on":[52],"randomly":[53],"generated":[54],"graphs":[55,64,87],"presented.Efficient":[57],"large":[61],"induced":[62,76],"outerplanar":[63,77],"also":[66],"given.One":[67],"shown":[72],"to":[73],"find":[74],"with":[79,91],"at":[80,94],"least":[81],"3n/(d":[82],"+":[83],"5/3)":[84],"n":[89],"maximum":[92],"degree":[93],"most":[95,104],"d.The":[96],"presented":[98],"in":[99],"paper":[101],"indicate":[102],"perform":[107],"substantially":[108],"better":[109],"than":[110],"lower":[113],"bounds":[114],"indicate.":[115]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2143368979","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-02-22T03:52:56.939919","created_date":"2016-06-24"}