{"id":"https://openalex.org/W4407777297","doi":"https://doi.org/10.3233/978-1-61499-484-8-11","title":"An efficient exact algorithm for P","display_name":"An efficient exact algorithm for P","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W4407777297","doi":"https://doi.org/10.3233/978-1-61499-484-8-11"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-484-8-11","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-484-8-11","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"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/A5073163299","display_name":"Maw\u2010Shang Chang","orcid":"https://orcid.org/0000-0003-1469-371X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chang Maw-Shang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116344253","display_name":"Chen Li-Hsuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen Li-Hsuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5116344254","display_name":"Hung Ling-Ju","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung Ling-Ju","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073163299"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.58298372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.5467000007629395,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.5467000007629395,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4897429943084717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47425925731658936}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4897429943084717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47425925731658936}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/978-1-61499-484-8-11","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-484-8-11","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Given":[0],"a":[1,7,11,22,24,40,63],"graph":[2,46],"G":[3,20,47],"=":[4],"(V,":[5],"E),":[6],"P2-packing":[8,41],"𝒫":[9,42],"is":[10,37,53,93,102],"collection":[12],"of":[13,17,48,79,105],"vertex":[14],"disjoint":[15],"copies":[16],"P2s":[18],"in":[19,43,71,89,107],"where":[21,100],"P2is":[23],"simple":[25],"path":[26],"with":[27],"three":[28],"vertices":[29,106],"and":[30,84],"two":[31],"edges.":[32],"The":[33],"MAXIMUM":[34,68],"P2-PACKING":[35,69],"problem":[36,52,70],"to":[38],"find":[39],"the":[44,67,76,80,103,108],"input":[45,109],"maximum":[49],"cardinality.":[50],"This":[51],"NP-hard":[54],"for":[55,66],"cubic":[56,72],"graphs.":[57,73],"In":[58],"this":[59],"paper,":[60],"we":[61],"give":[62],"branch-and-reduce":[64],"algorithm":[65,81],"We":[74],"analyze":[75],"running":[77],"time":[78,90],"using":[82],"measure-and-conquer":[83],"show":[85],"that":[86],"it":[87],"runs":[88],"O*(1.4366n)":[91],"which":[92],"faster":[94],"than":[95],"previous":[96],"known":[97],"exact":[98],"algorithms":[99],"n":[101],"number":[104],"graph.":[110]},"counts_by_year":[],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}