{"id":"https://openalex.org/W7137891856","doi":"https://doi.org/10.1609/aaai.v40i36.40265","title":"DCTR: Dual-Constraint Subgraph Optimization for Knowledge Graph-based Retrieval-Augmented Generation","display_name":"DCTR: Dual-Constraint Subgraph Optimization for Knowledge Graph-based Retrieval-Augmented Generation","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137891856","doi":"https://doi.org/10.1609/aaai.v40i36.40265"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i36.40265","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i36.40265","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i36.40265","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129739739","display_name":"Yukun Cao","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yukun Cao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129721605","display_name":"Zirui Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zirui Xu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129644288","display_name":"Dongyang Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dongyang Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025698469","display_name":"Zhihao Guo","orcid":"https://orcid.org/0000-0001-8315-5152"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhihao Guo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079864048","display_name":"Luobin Huang","orcid":"https://orcid.org/0009-0001-9994-1382"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luobin Huang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121758323","display_name":"Lisheng Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lisheng Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5129739739"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11182451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"36","first_page":"30156","last_page":"30164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9010999798774719,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9010999798774719,"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/T10028","display_name":"Topic Modeling","score":0.03420000150799751,"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/T10286","display_name":"Information Retrieval and Search Behavior","score":0.01269999984651804,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8313999772071838},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7922999858856201},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5741999745368958},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4487999975681305},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.446399986743927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4196000099182129},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.3783000111579895}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8313999772071838},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7922999858856201},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5741999745368958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5388000011444092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5015000104904175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.446399986743927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.3515999913215637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3260999917984009},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2538999915122986},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i36.40265","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i36.40265","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i36.40265","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i36.40265","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Knowledge":[0],"Graph":[1],"(KG)-based":[2],"Retrieval-Augmented":[3],"Generation":[4],"(RAG)":[5],"shifts":[6],"the":[7,51,86,160],"contents":[8],"of":[9,94],"retrieval":[10,110],"from":[11,79],"narrative":[12],"text":[13],"to":[14,24,49,57,135,151,162],"a":[15,100,129,146,155],"relational":[16],"knowledge":[17,47],"network,":[18],"empowering":[19],"large":[20],"language":[21],"models":[22],"(LLMs)":[23],"harness":[25],"structured":[26],"relationships":[27],"between":[28,88],"entities.":[29],"However,":[30],"conventional":[31],"KG-RAG":[32,105],"approaches":[33],"are":[34,64,144],"resource-intensive,":[35],"requiring":[36],"either":[37],"query":[38],"decomposition":[39],"with":[40,115],"multiple":[41],"LLM":[42,182],"rounds":[43],"or":[44],"parameterized":[45],"static":[46],"injection":[48],"update":[50],"model.":[52],"Although":[53],"subgraph":[54,89,102,109,126,176],"reasoning":[55],"aims":[56],"address":[58],"these":[59,142],"issues,":[60],"most":[61],"current":[62],"methods":[63],"based":[65],"on":[66],"heuristic":[67],"shortest":[68],"path":[69],"and":[70,81,84,90,111,118,138],"multi-hop":[71],"graph":[72],"traversal":[73],"algorithms.":[74],"The":[75],"retrieved":[76],"subgraphs":[77,114],"suffer":[78],"incompleteness":[80],"semantic":[82],"drift,":[83],"neglect":[85],"interaction":[87],"LLMs":[91],"in":[92,181],"terms":[93],"fine-grained":[95],"structural":[96,116],"semantics.":[97],"We":[98],"propose":[99],"dual-constraint":[101],"optimization":[103,133],"for":[104,121],"(DCTR).":[106],"It":[107],"improves":[108],"generates":[112],"high-quality":[113],"integrity":[117],"information":[119,165],"salience":[120],"LLMs.":[122],"Specifically,":[123],"it":[124],"formulates":[125],"generation":[127],"as":[128],"two-stage":[130],"graph-theoretic":[131],"constrained":[132],"problem":[134],"create":[136],"compact":[137],"complete":[139],"pseudo-labels.":[140],"Since":[141],"pseudo-labels":[143],"discrete,":[145],"smooth":[147],"approximation":[148],"is":[149],"employed":[150],"convert":[152],"them":[153],"into":[154],"differentiable":[156],"representation,":[157],"thereby":[158],"optimizing":[159],"retriever":[161],"highlight":[163],"key":[164],"while":[166],"extracting":[167],"subgraphs.":[168],"On":[169],"two":[170],"benchmark":[171],"datasets,":[172],"DCTR":[173],"significantly":[174],"enhances":[175],"quality,":[177],"achieving":[178],"state-of-the-art":[179],"performance":[180],"reasoning.":[183]},"counts_by_year":[],"updated_date":"2026-03-18T06:31:55.123368","created_date":"2026-03-18T00:00:00"}