{"id":"https://openalex.org/W7134946120","doi":"https://doi.org/10.48550/arxiv.2603.09475","title":"Some polynomial classes for the acyclic orientation with parity constraint problem","display_name":"Some polynomial classes for the acyclic orientation with parity constraint problem","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7134946120","doi":"https://doi.org/10.48550/arxiv.2603.09475"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05545067v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05545067","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05545067","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128736871","display_name":"Sylvain Gravier","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134975","display_name":"Ifm electronic (Germany)","ror":"https://ror.org/0473srk52","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210134975"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gravier, Sylvain","raw_affiliation_strings":["IF, SFR MAM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IF, SFR MAM","institution_ids":["https://openalex.org/I4210134975"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128789620","display_name":"Matthieu Petiteau","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134975","display_name":"Ifm electronic (Germany)","ror":"https://ror.org/0473srk52","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210134975"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Petiteau, Matthieu","raw_affiliation_strings":["IF, SFR MAM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IF, SFR MAM","institution_ids":["https://openalex.org/I4210134975"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026546650","display_name":"Isabelle Sivignon","orcid":null},"institutions":[{"id":"https://openalex.org/I4210160412","display_name":"Global Initiative on Psychiatry","ror":"https://ror.org/04whx4k53","country_code":"GE","type":"nonprofit","lineage":["https://openalex.org/I4210160412"]}],"countries":["GE"],"is_corresponding":false,"raw_author_name":"Sivignon, Isabelle","raw_affiliation_strings":["GIPSA-GAIA, SFR MAM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GIPSA-GAIA, SFR MAM","institution_ids":["https://openalex.org/I4210160412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.4846999943256378,"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":"Advanced Graph Theory Research","score":0.4846999943256378,"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":"Complexity and Algorithms in Graphs","score":0.20319999754428864,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.08760000020265579,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7146000266075134},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.539900004863739},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5051000118255615},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47929999232292175},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45730000734329224},{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.44179999828338623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41190001368522644},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3824999928474426}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7146000266075134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6980000138282776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6883000135421753},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5080999732017517},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5051000118255615},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45730000734329224},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.44179999828338623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41190001368522644},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3824999928474426},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.38199999928474426},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.37630000710487366},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3253999948501587},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3163999915122986},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.29269999265670776},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27549999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05545067v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05545067","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2603.09475","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09475","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05545067v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05545067","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7733837366104126}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,114,186,194,238],"study":[1,197],"the":[2,46,99,120,139,147,159,167,178,188,196,205,247,250],"problem":[3,50,100],"of":[4,9,22,122,141,149,166,180,198,204,211,217,249],"finding":[5],"an":[6,10,67,181],"acyclic":[7,123,182,225],"orientation":[8,25,49],"undirected":[11],"graph":[12,156],"with":[13,243],"constrained":[14],"in-degree":[15,36],"parities":[16],"specified":[17],"by":[18,201],"a":[19,31,76,127,163,202],"subset":[20,165],"T":[21,28,43,124,183,226],"vertices.":[23],"An":[24],"is":[26,51,85,174],"called":[27],"-odd":[29,125,184,227],"if":[30,37,40],"vertex":[32],"v":[33,41],"has":[34],"odd":[35],"and":[38,63,71,132,136,144,151,172,213],"only":[39],"P":[42],".":[44],"While":[45],"unconstrained":[47],"parity":[48,129],"polynomial":[52,233],"(Chevalier":[53],"et":[54,95],"al.":[55,96],"(1983)),":[56],"imposing":[57],"acyclicity":[58],"makes":[59],"it":[60,84,89],"more":[61],"challenging,":[62],"its":[64],"complexity":[65],"remains":[66],"open":[68],"question.":[69],"Szegedy":[70,72],"(":[73],"2006)":[74],"proposed":[75],"randomized":[77],"polynomial-time":[78],"algorithm":[79],"for":[80,119,161,177,208],"this":[81],"problem,":[82],"but":[83],"not":[86],"known":[87],"whether":[88],"belongs":[90],"to":[91,110,245],"co-NP.":[92],"Furthermore,":[93],"Gravier":[94],"(2025)":[97],"showed":[98],"becomes":[101],"NP-complete":[102],"on":[103],"partially":[104],"directed":[105],"graphs,":[106],"even":[107],"when":[108],"restricted":[109],"planar":[111],"cubic":[112],"graphs.":[113],"identify":[115],"three":[116],"necessary":[117,168],"conditions":[118,134,169],"existence":[121,140,179],"orientation:":[126],"global":[128],"condition":[130],"P,":[131,170],"two":[133],"S":[135,137,171,173],"ensuring":[138],"potential":[142],"sources":[143],"sinks.":[145],"Following":[146],"work":[148],"Frank":[150],"Kiraly":[152],"(2002),":[153],"we":[154],"define":[155],"classes":[157,200],"containing":[158],"graphs":[160],"which":[162],"given":[164],"also":[175],"sufficient":[176],"orientation.":[185],"establish":[187],"inclusion":[189],"relationships":[190],"between":[191],"these":[192,199,218,240],"classes.":[193],"complete":[195],"characterization":[203],"solvable":[206],"instances":[207],"Cartesian":[209],"products":[210],"paths":[212],"cycles.":[214],"The":[215],"proofs":[216],"results":[219],"are":[220],"all":[221],"constructive,":[222],"so":[223],"that":[224],"orientations":[228],"can":[229],"be":[230],"built":[231],"in":[232,253],"time":[234],"whenever":[235],"they":[236],"exist.":[237],"use":[239],"families,":[241],"along":[242],"cliques,":[244],"demonstrate":[246],"strictness":[248],"class":[251],"inclusions":[252],"our":[254],"hierarchy.":[255]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-12T00:00:00"}