{"id":"https://openalex.org/W7164339926","doi":"https://doi.org/10.48550/arxiv.2606.11582","title":"Querying Cohesive Subgraph regarding Span-Constrained Triangles on Temporal Graphs with Dynamic Index Maintenance","display_name":"Querying Cohesive Subgraph regarding Span-Constrained Triangles on Temporal Graphs with Dynamic Index Maintenance","publication_year":2026,"publication_date":"2026-06-10","ids":{"openalex":"https://openalex.org/W7164339926","doi":"https://doi.org/10.48550/arxiv.2606.11582"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11582","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":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.2606.11582","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108959023","display_name":"Chuhan Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Chuhan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138438659","display_name":"Ming Zhong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhong, Ming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138434695","display_name":"Lei Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Lei","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/T11106","display_name":"Data Management and Algorithms","score":0.4625999927520752,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.4625999927520752,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.17589999735355377,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.11559999734163284,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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","display_name":"Graph","score":0.5654000043869019},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.474700003862381},{"id":"https://openalex.org/keywords/truss","display_name":"Truss","score":0.46950000524520874},{"id":"https://openalex.org/keywords/temporal-database","display_name":"Temporal database","score":0.42160001397132874},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.398499995470047},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.38269999623298645},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3824999928474426},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.36800000071525574},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3547999858856201}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6715999841690063},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5654000043869019},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5044999718666077},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C173534245","wikidata":"https://www.wikidata.org/wiki/Q1328068","display_name":"Truss","level":2,"score":0.46950000524520874},{"id":"https://openalex.org/C77277458","wikidata":"https://www.wikidata.org/wiki/Q1969246","display_name":"Temporal database","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.421099990606308},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3824999928474426},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37059998512268066},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.27810001373291016},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25999999046325684},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11582","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":"doi:10.48550/arxiv.2606.11582","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11582","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recent":[0],"advances":[1],"in":[2,138],"temporal":[3,27,44,96],"graph":[4,10],"research":[5],"have":[6],"redefined":[7],"traditional":[8],"static":[9,42],"concepts":[11],"such":[12],"as":[13],"triangles,":[14],"motifs,":[15],"and":[16,43,64,108,141,161],"$k$-cores.":[17],"Inspired":[18],"by":[19,146],"this,":[20],"we":[21,61,98,118],"introduce":[22],"a":[23,51],"novel":[24],"$(k,\u03b4)$-truss":[25,39,59],"for":[26,121],"graphs,":[28,97],"requiring":[29],"triangles":[30],"to":[31,94,159],"exist":[32],"within":[33],"sufficiently":[34],"short":[35],"time":[36,140],"windows.":[37],"The":[38,129],"ensures":[40],"both":[41],"cohesion,":[45],"while":[46,88,151],"the":[47,68,122,126,143,152],"original":[48],"$k$-truss":[49],"is":[50],"special":[52],"case":[53],"when":[54],"$\u03b4=":[55],"\\infty$.":[56],"To":[57,92],"address":[58],"queries,":[60],"propose":[62],"index-free":[63,144],"index-based":[65,134],"approaches.":[66],"Utilizing":[67],"dual":[69],"containment":[70],"relation":[71],"of":[72,125,149,157],"$(k,\u03b4)$-trusses,":[73],"our":[74],"indexes":[75,153],"losslessly":[76],"compress":[77],"all":[78],"$(k,\u03b4)$-trusses":[79],"into":[80],"map":[81],"or":[82],"tree":[83],"structures,":[84],"significantly":[85],"reducing":[86],"space":[87],"enabling":[89],"optimal-time":[90],"retrieval.":[91],"scale":[93],"large":[95],"develop":[99],"two":[100],"index":[101],"construction":[102],"algorithms":[103],"based":[104],"on":[105],"truss":[106,109],"decomposition":[107],"maintenance,":[110],"respectively,":[111],"which":[112],"substantially":[113],"reduce":[114],"redundant":[115],"computations.":[116],"Moreover,":[117],"present":[119],"techniques":[120],"dynamic":[123],"maintenance":[124],"proposed":[127],"indexes.":[128],"experimental":[130],"results":[131],"demonstrate":[132],"that":[133],"approaches":[135],"process":[136],"queries":[137],"interactive":[139],"outperform":[142],"approach":[145],"2$\\sim$4":[147],"orders":[148],"magnitude,":[150],"achieve":[154],"compression":[155],"ratios":[156],"up":[158],"$10^{-4}$":[160],"can":[162],"be":[163],"updated":[164],"efficiently":[165],"without":[166],"rebuilding":[167],"from":[168],"scratch.":[169]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-12T00:00:00"}