{"id":"https://openalex.org/W4321448365","doi":"https://doi.org/10.14778/3574245.3574264","title":"Quasi-Stable Coloring for Graph Compression","display_name":"Quasi-Stable Coloring for Graph Compression","publication_year":2022,"publication_date":"2022-12-01","ids":{"openalex":"https://openalex.org/W4321448365","doi":"https://doi.org/10.14778/3574245.3574264"},"language":"en","primary_location":{"id":"doi:10.14778/3574245.3574264","is_oa":false,"landing_page_url":"http://dx.doi.org/10.14778/3574245.3574264","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/A5042488652","display_name":"Moe Kayali","orcid":"https://orcid.org/0000-0002-0643-6468"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moe Kayali","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048204602","display_name":"Dan Suciu","orcid":"https://orcid.org/0000-0002-4144-0868"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Suciu","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3042,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62385957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"16","issue":"4","first_page":"803","last_page":"815"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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.9768000245094299,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9527000188827515,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.8121030926704407},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6104602813720703},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5855307579040527},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5347655415534973},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4961152970790863},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.48930713534355164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48361697793006897},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.45088350772857666},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.43870607018470764},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4341100752353668},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41538718342781067},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37999337911605835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36587411165237427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36185306310653687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34954315423965454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26397591829299927},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.235637366771698},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.21376031637191772},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1961250603199005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19039598107337952},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07722938060760498}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.8121030926704407},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6104602813720703},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5855307579040527},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5347655415534973},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4961152970790863},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.48930713534355164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48361697793006897},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.45088350772857666},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.43870607018470764},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4341100752353668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41538718342781067},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37999337911605835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36587411165237427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36185306310653687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34954315423965454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26397591829299927},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.235637366771698},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.21376031637191772},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1961250603199005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19039598107337952},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07722938060760498}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3574245.3574264","is_oa":false,"landing_page_url":"http://dx.doi.org/10.14778/3574245.3574264","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1971421925","https://openalex.org/W1971937094","https://openalex.org/W2013451793","https://openalex.org/W2068361557","https://openalex.org/W2104974755","https://openalex.org/W2108614537","https://openalex.org/W2152691118","https://openalex.org/W2171707538","https://openalex.org/W2181072414","https://openalex.org/W2278710066","https://openalex.org/W2743930031","https://openalex.org/W2747329762","https://openalex.org/W2963794747","https://openalex.org/W2988480584","https://openalex.org/W3094504436","https://openalex.org/W3101413764","https://openalex.org/W3128841739","https://openalex.org/W3194212532","https://openalex.org/W4235571646","https://openalex.org/W4300302225","https://openalex.org/W4393415098"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W4297911588","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W2793500002","https://openalex.org/W2046652778","https://openalex.org/W1542397451","https://openalex.org/W2380525562","https://openalex.org/W2385428710"],"abstract_inverted_index":{"We":[0,58,100],"propose":[1,59,150],"quasi-stable":[2,72,119,138,164],"coloring":[3,120,165],",":[4],"an":[5],"approximate":[6,65],"version":[7],"of":[8,36,92,97],"stable":[9],"coloring.":[10,73],"Stable":[11],"coloring,":[12],"also":[13],"called":[14],"color":[15,56,66],"refinement,":[16],"is":[17,41,147],"a":[18,87,118,136,151],"well-studied":[19],"technique":[20,166],"in":[21,114,143],"graph":[22],"theory":[23],"for":[24,81,86],"classifying":[25],"vertices,":[26],"which":[27,69],"can":[28,121],"be":[29],"used":[30],"to":[31,44,62,123,134],"build":[32],"compact,":[33],"lossless":[34],"representations":[35],"graphs.":[37],"However,":[38],"its":[39,45],"usefulness":[40],"limited":[42],"due":[43],"reliance":[46],"on":[47,126,157,167],"strict":[48,82],"symmetries.":[49],"Real":[50],"data":[51],"compresses":[52],"very":[53],"poorly":[54],"using":[55,75],"refinement.":[57],"the":[60,79,90,95,98,127,163],"first,":[61],"our":[63],"knowledge,":[64],"refinement":[67],"scheme,":[68],"we":[70,77,131,140,160],"call":[71],"By":[74],"approximation,":[76],"alleviate":[78],"need":[80],"symmetry,":[83],"and":[84,94,107,110,149,171],"allow":[85],"tradeoff":[88],"between":[89],"degree":[91],"compression":[93],"accuracy":[96],"representation.":[99],"study":[101],"three":[102],"applications:":[103],"Linear":[104],"Programming,":[105],"Max-Flow,":[106],"Betweenness":[108],"Centrality,":[109],"provide":[111],"theoretical":[112],"evidence":[113],"each":[115],"case":[116],"that":[117],"lead":[122],"good":[124],"approximations":[125],"reduced":[128],"graph.":[129],"Next,":[130],"consider":[132],"how":[133],"compute":[135],"maximal":[137],"coloring:":[139],"prove":[141],"that,":[142],"general,":[144],"this":[145],"problem":[146],"NP-hard,":[148],"simple,":[152],"yet":[153],"effective":[154],"algorithm":[155],"based":[156],"heuristics.":[158],"Finally,":[159],"evaluate":[161],"experimentally":[162],"several":[168],"real":[169],"graphs":[170],"applications,":[172],"comparing":[173],"with":[174],"prior":[175],"approximation":[176],"techniques.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}