{"id":"https://openalex.org/W7160518836","doi":"https://doi.org/10.48550/arxiv.2605.04701","title":"When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results","display_name":"When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160518836","doi":"https://doi.org/10.48550/arxiv.2605.04701"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.04701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04701","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.04701","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069998979","display_name":"Guozhen Rong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rong, Guozhen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135595991","display_name":"Xin Li","orcid":"https://orcid.org/0000-0001-7733-439X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032235006","display_name":"Yongjie Yang","orcid":"https://orcid.org/0000-0002-7731-6818"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Yongjie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.862500011920929,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.862500011920929,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08540000021457672,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.010700000450015068,"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/graph-traversal","display_name":"Graph traversal","score":0.602400004863739},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.5630000233650208},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5471000075340271},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5087000131607056},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4309999942779541},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4287000000476837},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.41530001163482666},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.35359999537467957}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.602400004863739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5659999847412109},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.5630000233650208},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5471000075340271},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5087000131607056},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48429998755455017},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4309999942779541},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.424699991941452},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.41530001163482666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3614000082015991},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.35359999537467957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3368000090122223},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.31769999861717224},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.30640000104904175},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.30059999227523804},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.29899999499320984},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.287200003862381},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27639999985694885},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.2741999924182892},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2694000005722046},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2646999955177307}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.04701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04701","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"doi:10.48550/arxiv.2605.04701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04701","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7597425580024719,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Preference":[0],"restrictions":[1,19],"have":[2,143,170],"played":[3],"a":[4,14,31,50,90,95,107,151,181,185],"significant":[5],"role":[6],"in":[7,191],"computational":[8],"social":[9],"choice.":[10],"This":[11],"paper":[12],"studies":[13],"framework":[15],"that":[16,102,110,131,178],"connects":[17],"preference":[18,36,92,112,182],"with":[20],"classical":[21],"graph":[22,32,47,51,96,108,120,138,165,206],"search":[23,60,63,66,73,78],"paradigms.":[24],"We":[25,53,154],"model":[26],"candidates":[27],"as":[28,41],"vertices":[29],"of":[30,38,44,87,200],"and":[33,75,210],"interpret":[34],"the":[35,42,46,85,119,122,137,161,164,201,214],"ordering":[37,113],"each":[39,111],"voter":[40],"outcome":[43],"traversing":[45,118],"according":[48],"to":[49,99,142,160,169],"search.":[52],"focus":[54],"on":[55],"six":[56],"fundamental":[57],"paradigms:":[58],"breadth-first":[59,65],"(BFS),":[61],"depth-first":[62,69],"(DFS),":[64],"(LexBFS),":[67],"lexicographic":[68],"(LexDFS),":[70],"maximum":[71,171],"cardinality":[72],"(MCS),":[74],"maximal":[76],"neighborhood":[77],"(MNS).":[79],"Within":[80],"this":[81,132],"framework,":[82],"we":[83,129,176],"study":[84],"problem":[86,133,202],"determining":[88],"whether":[89,104,180],"given":[91,152],"profile":[93,183],"admits":[94,184],"support":[97,139,166,187],"subject":[98],"structural":[100],"restrictions,":[101],"is,":[103],"there":[105],"exists":[106],"such":[109],"can":[114,188],"be":[115,189],"generated":[116],"by":[117],"under":[121],"chosen":[123],"paradigm.":[124],"For":[125,174],"all":[126,204],"considered":[127],"paradigms,":[128],"show":[130],"is":[134,140,150,167],"NP-hard":[135],"when":[136],"required":[141,168],"at":[144],"most":[145],"$k$":[146,149],"edges,":[147],"where":[148,163],"integer.":[153],"further":[155],"extend":[156],"these":[157],"hardness":[158],"results":[159,196],"case":[162],"degree":[172],"$k$.":[173],"DFS,":[175],"prove":[177],"recognizing":[179],"tree":[186],"solved":[190],"polynomial":[192],"time.":[193],"Moreover,":[194],"existing":[195],"imply":[197],"polynomial-time":[198],"solvability":[199],"for":[203,212],"remaining":[205],"traversals,":[207],"except":[208],"BFS":[209],"LexBFS,":[211],"which":[213],"complexity":[215],"remains":[216],"open.":[217]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-08T00:00:00"}