{"id":"https://openalex.org/W4401161352","doi":"https://doi.org/10.1587/transinf.2024fcp0009","title":"An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems","display_name":"An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems","publication_year":2024,"publication_date":"2024-07-31","ids":{"openalex":"https://openalex.org/W4401161352","doi":"https://doi.org/10.1587/transinf.2024fcp0009"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2024fcp0009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2024fcp0009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/advpub/0/advpub_2024FCP0009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/advpub/0/advpub_2024FCP0009/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013939711","display_name":"Hitoshi Murakami","orcid":"https://orcid.org/0000-0003-2268-045X"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hitoshi MURAKAMI","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039274625","display_name":"Yutaro Yamaguchi","orcid":"https://orcid.org/0000-0002-1919-7195"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yutaro YAMAGUCHI","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08399675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"E108.D","issue":"3","first_page":"214","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9735999703407288,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9735999703407288,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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":"Optimization and Search Problems","score":0.9614999890327454,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9380000233650208,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.7701902985572815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5770410895347595},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5125675201416016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33884716033935547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1509702205657959},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.043636322021484375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7701902985572815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5770410895347595},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5125675201416016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33884716033935547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1509702205657959},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.043636322021484375}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2024fcp0009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2024fcp0009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/advpub/0/advpub_2024FCP0009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2024fcp0009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2024fcp0009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/advpub/0/advpub_2024FCP0009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3757366382","display_name":"Research on Integrated Techniques of Enumeration and Optimization Based on Discrete Structure Manipulation Systems","funder_award_id":"20H00605","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4119598545","display_name":"Exploration into Matroid Common Base Packing Problem","funder_award_id":"20K19743","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401161352.pdf","grobid_xml":"https://content.openalex.org/works/W4401161352.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1952454332","https://openalex.org/W1986282076","https://openalex.org/W1998621342","https://openalex.org/W2030295282","https://openalex.org/W2039568698","https://openalex.org/W2051856222","https://openalex.org/W2079828065","https://openalex.org/W2166115470","https://openalex.org/W2174697474","https://openalex.org/W2569646339","https://openalex.org/W2610479830","https://openalex.org/W2914414140","https://openalex.org/W2988480584","https://openalex.org/W4210431029","https://openalex.org/W4221148218","https://openalex.org/W4225881827","https://openalex.org/W4233756358","https://openalex.org/W4285580028","https://openalex.org/W4286588294","https://openalex.org/W4293179730","https://openalex.org/W4309955387","https://openalex.org/W4383473090","https://openalex.org/W4390723161"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"The":[0],"exact":[1],"matching":[2,11,36,134],"problem":[3,129,145],"is":[4,31,56,146],"a":[5,14,20,34,47,79,94,101,127,139],"constrained":[6],"variant":[7],"of":[8,37,96,112,142],"the":[9,29,85,109,120,131],"maximum":[10],"problem:":[12],"given":[13],"graph":[15],"with":[16],"each":[17],"edge":[18],"having":[19],"weight":[21,38],"0":[22],"or":[23],"1":[24],"and":[25,43,54,69,136],"an":[26,113,143],"integer":[27],"k,":[28],"goal":[30],"to":[32,119],"find":[33],"perfect":[35],"exactly":[39],"k.":[40],"Mulmuley,":[41],"Vazirani,":[42],"Vazirani":[44],"(1987)":[45],"proposed":[46],"randomized":[48],"polynomial-time":[49],"algorithm":[50,82,104],"for":[51,74],"this":[52,90],"problem,":[53,135],"it":[55,60],"still":[57],"open":[58],"whether":[59],"can":[61],"be":[62],"derandomized.":[63],"Very":[64],"recently,":[65],"El":[66],"Maalouly,":[67],"Steiner,":[68],"Wulf":[70],"(2023)":[71],"showed":[72],"that":[73,138],"bipartite":[75],"graphs":[76],"there":[77],"exists":[78],"deterministic":[80,102],"FPT":[81,103],"parameterized":[83,107],"by":[84,92,108],"(bipartite)":[86,121],"independence":[87,122],"number.":[88,123],"In":[89],"paper,":[91],"extending":[93],"part":[95],"their":[97],"work,":[98],"we":[99],"propose":[100],"in":[105,117],"general":[106],"minimum":[110],"size":[111],"odd":[114],"cycle":[115],"transversal":[116],"addition":[118],"We":[124],"also":[125],"consider":[126],"relaxed":[128],"called":[130],"correct":[132],"parity":[133],"show":[137],"slight":[140],"generalization":[141],"equivalent":[144],"NP-hard.":[147]},"counts_by_year":[],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}