{"id":"https://openalex.org/W7159657015","doi":"https://doi.org/10.48550/arxiv.2604.28096","title":"Succinct Graph Representations and Algorithmic Applications","display_name":"Succinct Graph Representations and Algorithmic Applications","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7159657015","doi":"https://doi.org/10.48550/arxiv.2604.28096"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.28096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.28096","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.2604.28096","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134987297","display_name":"Ahammed Ullah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ullah, Ahammed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pothen, Alex","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/T12292","display_name":"Graph Theory and Algorithms","score":0.6687999963760376,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6687999963760376,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13609999418258667,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.031599998474121094,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4733000099658966},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.45890000462532043},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42089998722076416},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.3995000123977661},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.36320000886917114},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.3425000011920929},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.3398999869823456},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.337799996137619},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.33149999380111694}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.569599986076355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5647000074386597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4733000099658966},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.45890000462532043},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42089998722076416},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.3995000123977661},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3596000075340271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34290000796318054},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.3425000011920929},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.337799996137619},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.33149999380111694},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3287999927997589},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.31850001215934753},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.29490000009536743},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2632000148296356},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.258899986743927},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.28096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.28096","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.2604.28096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.28096","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,58,75,85,169,231],"propose":[1],"new":[2],"graph":[3,19,83,88,150,172],"representations":[4,65,161,176,251],"that":[5,44,66,87,135,240],"exploit":[6],"dense":[7],"local":[8],"structure":[9],"to":[10,31,109],"improve":[11,139],"time":[12,107,141],"and":[13,50,69,100,142,162,186,197,219,238],"space":[14,143],"simultaneously.":[15],"Given":[16],"an":[17],"undirected":[18],"$G$,":[20],"we":[21,153],"define":[22],"a":[23,40,113,131,181,215,227,245],"dual":[24,55],"clique":[25],"cover":[26],"(DCC)":[27],"representation":[28,115],"of":[29,42,48,56,61,112,120,133,145,184,217,229],"$G$":[30,49],"be":[32,104],"the":[33,46,53,110,118,140,202,241],"pair":[34],"$(C,":[35],"L)$,":[36],"where":[37],"$C$":[38],"is":[39,52],"collection":[41,183],"cliques":[43],"covers":[45],"edges":[47],"$L$":[51],"incidence":[54],"$C$.":[57],"identify":[59],"classes":[60],"polynomial-time":[62],"constructible":[63],"DCC":[64,73,114,126,160,175,235,250],"are":[67],"compact":[68],"call":[70],"them":[71],"succinct":[72,125,159],"representations.":[74,151],"then":[76],"develop":[77],"representation-aware":[78],"algorithms":[79,134,156,173,237],"for":[80,157,200,253],"several":[81,155,171,234],"fundamental":[82],"problems.":[84],"show":[86,192],"primitives":[89],"such":[90],"as":[91],"connected":[92,203],"components,":[93],"breadth-first":[94],"search":[95,98],"forests,":[96,99],"depth-first":[97],"maximal":[101],"matchings":[102],"can":[103],"computed":[105],"in":[106,248],"proportional":[108],"size":[111],"rather":[116],"than":[117],"number":[119],"edges.":[121],"Combined":[122],"with":[123,214,226],"our":[124],"representations,":[127],"these":[128],"results":[129],"give":[130],"class":[132],"either":[136],"match":[137],"or":[138],"bounds":[144],"their":[146,167],"counterparts":[147],"on":[148,166,174,180,212,224],"standard":[149],"Furthermore,":[152],"design":[154],"constructing":[158],"establish":[163],"provable":[164],"guarantees":[165],"efficiency.":[168],"evaluate":[170,233],"against":[177],"adjacency-list-based":[178],"implementations":[179],"large":[182],"real-world":[185],"synthetic":[187],"graphs.":[188],"All":[189],"evaluated":[190],"applications":[191],"substantial":[193],"execution":[194,209],"memory":[195,210],"savings":[196,211],"total-time":[198,222],"speedups;":[199],"example,":[201],"components":[204],"algorithm":[205],"achieves":[206],"about":[207,220],"$9\\times$":[208],"average,":[213,225],"maximum":[216,228],"$35\\times$,":[218],"$6.5\\times$":[221],"speedups":[223],"$35\\times$.":[230],"also":[232],"construction":[236],"find":[239],"succinctness":[242],"property":[243],"plays":[244],"key":[246],"role":[247],"making":[249],"effective":[252],"algorithmic":[254],"applications.":[255]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-02T00:00:00"}