{"id":"https://openalex.org/W2949055953","doi":"https://doi.org/10.1145/3299869.3300082","title":"Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs","display_name":"Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs","publication_year":2019,"publication_date":"2019-06-18","ids":{"openalex":"https://openalex.org/W2949055953","doi":"https://doi.org/10.1145/3299869.3300082","mag":"2949055953"},"language":"en","primary_location":{"id":"doi:10.1145/3299869.3300082","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3300082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101772111","display_name":"Yikai Zhang","orcid":"https://orcid.org/0000-0003-4924-7824"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yikai Zhang","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101772111"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":4.404,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.95002519,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1024","last_page":"1041"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9871000051498413,"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.9858999848365784,"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/bounded-function","display_name":"Bounded function","score":0.7312406301498413},{"id":"https://openalex.org/keywords/truss","display_name":"Truss","score":0.6256786584854126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4750640094280243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47446709871292114},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.45695164799690247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4294256567955017},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41885802149772644},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38012078404426575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3770374357700348},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3394621014595032},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33806222677230835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3058382570743561}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7312406301498413},{"id":"https://openalex.org/C173534245","wikidata":"https://www.wikidata.org/wiki/Q1328068","display_name":"Truss","level":2,"score":0.6256786584854126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4750640094280243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47446709871292114},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.45695164799690247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4294256567955017},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41885802149772644},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38012078404426575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3770374357700348},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3394621014595032},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33806222677230835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3058382570743561},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3299869.3300082","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3300082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1576857282","https://openalex.org/W1676865579","https://openalex.org/W1974874717","https://openalex.org/W1975360581","https://openalex.org/W2023536175","https://openalex.org/W2026511056","https://openalex.org/W2042949485","https://openalex.org/W2045102550","https://openalex.org/W2049354208","https://openalex.org/W2062705952","https://openalex.org/W2067332908","https://openalex.org/W2125895010","https://openalex.org/W2140055897","https://openalex.org/W2142599626","https://openalex.org/W2228089378","https://openalex.org/W2297833300","https://openalex.org/W2528743325","https://openalex.org/W2613088476","https://openalex.org/W2613159091","https://openalex.org/W2753758798","https://openalex.org/W2765884153","https://openalex.org/W2766308819","https://openalex.org/W2799896657","https://openalex.org/W2890003917","https://openalex.org/W2952642370","https://openalex.org/W2962676535","https://openalex.org/W3101950588","https://openalex.org/W3102137745"],"related_works":["https://openalex.org/W2955404263","https://openalex.org/W2055188469","https://openalex.org/W2365888646","https://openalex.org/W4238655142","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Due":[0],"to":[1,40,59,73,100,178,189,202,261],"the":[2,47,98,102,105,111,114,137,163,187,190,207,236,239,257,267],"ubiquity":[3],"of":[4,20,49,81,113,117,139,184,238,242,264,285],"graphs,":[5],"graph":[6,26,103],"analytics":[7],"has":[8,127],"attracted":[9],"much":[10],"attention":[11],"from":[12,43,280],"both":[13,101],"research":[14],"and":[15,36,89,104,107,132,192,227,273],"industry":[16],"communities.":[17],"The":[18],"notion":[19,169],"k-truss":[21],"is":[22,38,71,80,110,123,133,148,154,198],"widely":[23],"used":[24],"in":[25,33,218,292],"analytics.":[27],"Since":[28],"graphs":[29,63,271],"are":[30,64,274],"continuously":[31],"evolving":[32],"real":[34,270],"applications":[35],"it":[37,126],"costly":[39],"compute":[41],"trusses":[42,61,279],"scratch,":[44],"we":[45,143,165],"study":[46],"problem":[48,122],"truss":[50,146],"maintenance":[51,147],"which":[52],"aims":[53],"at":[54],"designing":[55],"efficient":[56,276],"incremental":[57,69,121,130],"algorithms":[58,253],"update":[60],"when":[62],"updated":[65],"with":[66,200,232],"changes.":[67],"An":[68,120],"algorithm":[70,131,196,216],"desired":[72],"be":[74],"bounded;":[75],"that":[76,145,197,250],"is,":[77],"its":[78],"cost":[79],"$O(f(\\|\\textttCHANGED":[82],"\\|_c))$":[83],"for":[84,157,209,222,266,283],"some":[85,90,223,228],"polynomial":[86,224],"function":[87,225],"f":[88,226],"positive":[91,229],"integer":[92,230],"c,":[93],"where":[94],"$\\textttCHANGED":[95,118,179],"$":[96],"comprises":[97],"changes":[99,188,284],"result":[106],"$\\|\\textttCHANGED":[108],"\\|_c$":[109],"size":[112,237],"c-hop":[115,240],"neighborhood":[116,241],"$.":[119],"bounded":[124,129,149,199],"if":[125],"a":[128,167,174,182],"unbounded":[134,155],"otherwise.":[135],"Under":[136],"model":[138],"locally":[140],"persistent":[141],"algorithms,":[142],"prove":[144],"under":[150],"edge":[151,159,210],"removals":[152],"but":[153],"even":[156,282],"unit":[158],"insertions.":[160],"To":[161],"address":[162],"unboundedness,":[164],"formulate":[166],"new":[168,252],"$\\textttAFF":[170,203,243],"^\\preceq$":[171],"which,":[172],"as":[173],"practically":[175],"effective":[176],"alternative":[177],"$,":[180],"represents":[181],"set":[183],"edgesaffected":[185],"by":[186,259],"graph,":[191],"devise":[193],"an":[194],"insertion":[195,215],"respect":[201],"^\\preceq$,":[204],"while":[205],"retaining":[206],"boundedness":[208],"removals.":[211],"More":[212],"specifically,":[213],"our":[214,251,290],"runs":[217],"$O(f(\\|\\textttAFF":[219],"^\\preceq\\|_c))$":[220],"time":[221],"c":[231],"$\\|\\textttAFF":[233],"^\\preceq\\|_c$":[234],"being":[235],"^\\preceq$.":[244],"Our":[245],"extensive":[246],"performance":[247],"studies":[248],"show":[249],"can":[254],"significantly":[255],"outperform":[256],"state-of-the-art":[258],"up":[260],"3":[262],"orders":[263],"magnitude":[265],"12":[268],"large":[269],"tested":[272],"more":[275],"than":[277],"computing":[278],"scratch":[281],"non-trivial":[286],"size.":[287],"We":[288],"report":[289],"findings":[291],"this":[293],"paper.":[294]},"counts_by_year":[{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}