{"id":"https://openalex.org/W4253929783","doi":"https://doi.org/10.1137/1.9781611973402.42","title":"Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity","display_name":"Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity","publication_year":2013,"publication_date":"2013-12-18","ids":{"openalex":"https://openalex.org/W4253929783","doi":"https://doi.org/10.1137/1.9781611973402.42"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973402.42","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.42","source":null,"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.42","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090761492","display_name":"Yutaro Yamaguchi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165074","display_name":"Information and Mathematical Science and Bioinformatics (Japan)","ror":"https://ror.org/05rgpb984","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210165074"]},{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yutaro Yamaguchi","raw_affiliation_string":"Department of Mathematical Informatics, University of Tokyo, Japan.","raw_affiliation_strings":["Department of Mathematical Informatics, University of Tokyo, Japan."]}],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090761492"],"corresponding_institution_ids":["https://openalex.org/I4210165074","https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"cited_by_percentile_year":{"min":71,"max":77},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"Optical Code Division Multiple Access","score":0.9975,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"Optical Code Division Multiple Access","score":0.9975,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9872,"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/T10374","display_name":"Graph Theory and Algorithms","score":0.9863,"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":[{"keyword":"linear matroid parity","score":0.5575},{"keyword":"graphs","score":0.5006},{"keyword":"group-labelled","score":0.25}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.84615624},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.6336343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.60598004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46087438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44756547},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36754292},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13797337},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.06639516}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973402.42","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.42","source":null,"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973402.42","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.42","source":null,"license":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2381226549","https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W3000635646"],"ngrams_url":"https://api.openalex.org/works/W4253929783/ngrams","abstract_inverted_index":{"Previous":[0,267],"chapter":[1,3,268,270],"Next":[2,269],"Full":[4],"AccessProceedings":[5],"Proceedings":[6],"of":[7,44,91,105,140,156,170,219,258],"the":[8,72,132,168,171,194,203,240,248,256,259],"2014":[9],"Annual":[10],"ACM-SIAM":[11],"Symposium":[12],"on":[13],"Discrete":[14],"Algorithms":[15],"(SODA)Packing":[16],"A-paths":[17,108,143,222,235],"in":[18,109,178,196],"Group-Labelled":[19],"Graphs":[20],"via":[21],"Linear":[22],"Matroid":[23],"ParityYutaro":[24],"YamaguchiYutaro":[25],"Yamaguchipp.562":[26],"-":[27],"569Chapter":[28],"DOI:https://doi.org/10.1137/1.9781611973402.42PDFBibTexSections":[29],"ToolsAdd":[30],"to":[31,64,71,85,160,182,198,202,239,247],"favoritesExport":[32],"CitationTrack":[33],"CitationsEmail":[34],"SectionsAboutAbstract":[35],"Mader's":[36,92],"disjoint":[37,49],"S-paths":[38],"problem":[39,60,76],"is":[40,180,263],"a":[41,55,62,89,103,114,138,145,153,188,200,209,237],"common":[42],"generalization":[43,90],"non-bipartite":[45],"matching":[46],"and":[47,99,112,119,190,253],"Menger's":[48],"paths":[50],"problems.":[51],"Lov\u00e1sz":[52],"(1980)":[53],"suggested":[54],"polynomial-time":[56],"algorithm":[57,126],"for":[58,127,193,215],"this":[59,128,149],"through":[61],"reduction":[63,70,158,201,238],"matroid":[65,74,205,242],"matching.":[66],"A":[67],"more":[68],"direct":[69],"linear":[73,204,241],"parity":[75,206,243],"was":[77],"given":[78],"later":[79],"by":[80,164],"Schrijver":[81],"(2003),":[82],"which":[83,174,245],"leads":[84,246],"faster":[86,213],"algorithms.":[87],"As":[88,208],"problem,":[93,244],"Chudnovsky,":[94,117],"Geelen,":[95],"Gerards,":[96],"Goddyn,":[97],"Lohman,":[98],"Seymour":[100],"(2006)":[101],"introduced":[102,137,163],"framework":[104,139,162],"packing":[106,141,183,220,233],"non-zero":[107,221],"group-labelled":[110],"graphs,":[111],"proved":[113],"min-max":[115],"theorem.":[116],"Cunningham,":[118],"Geelen":[120],"(2008)":[121],"provided":[122],"an":[123],"efficient":[124,250],"combinatorial":[125],"generalized":[129],"problem.":[130,207],"On":[131],"other":[133],"hand,":[134],"Pap":[135,165],"(2007)":[136],"non-returning":[142,184,234],"as":[144,224],"further":[146],"genaralization.":[147],"In":[148,227],"paper,":[150],"we":[151,211],"discuss":[152],"possible":[154],"extension":[155],"Schrijver's":[157],"technique":[159],"another":[161],"(2006),":[166],"under":[167],"name":[169],"subgroup":[172],"model,":[173],"apparently":[175],"generalizes":[176],"but":[177],"fact":[179],"equivalent":[181],"A-paths.":[185,226],"We":[186],"provide":[187],"necessary":[189],"sufficient":[191],"condition":[192],"groups":[195],"question":[197],"admit":[199],"consequence,":[210],"give":[212],"algorithms":[214],"important":[216],"special":[217],"cases":[218],"such":[223],"odd-length":[225],"addition,":[228],"it":[229],"turns":[230],"out":[231],"that":[232],"admits":[236],"quite":[249],"solvability,":[251],"if":[252,255],"only":[254],"size":[257],"input":[260],"label":[261],"set":[262],"at":[264],"most":[265],"four.":[266],"RelatedDetails":[271],"Published:2014ISBN:978-1-61197-338-9eISBN:978-1-61197-340-2":[272],"https://doi.org/10.1137/1.9781611973402Book":[273],"Series":[274],"Name:ProceedingsBook":[275],"Code:PRDA14Book":[276],"Pages:viii":[277],"+":[278],"1885":[279]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4253929783","counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2024-02-22T23:58:40.966984","created_date":"2022-05-12"}