{"id":"https://openalex.org/W1990976277","doi":"https://doi.org/10.1145/1141277.1141385","title":"On the transitive closure representation and adjustable compression","display_name":"On the transitive closure representation and adjustable compression","publication_year":2006,"publication_date":"2006-04-23","ids":{"openalex":"https://openalex.org/W1990976277","doi":"https://doi.org/10.1145/1141277.1141385","mag":"1990976277"},"language":"en","primary_location":{"id":"doi:10.1145/1141277.1141385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1141277.1141385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM symposium on Applied computing","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/A5115602977","display_name":"Yangjun Chen","orcid":"https://orcid.org/0000-0002-4991-9558"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Yangjun Chen","raw_affiliation_strings":["University of Winnipeg, Manitoba, Canada","University of Winnipeg, Manitoba, Canada,"],"affiliations":[{"raw_affiliation_string":"University of Winnipeg, Manitoba, Canada","institution_ids":["https://openalex.org/I872945872"]},{"raw_affiliation_string":"University of Winnipeg, Manitoba, Canada,","institution_ids":["https://openalex.org/I872945872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003476293","display_name":"Donovan Cooke","orcid":null},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Donovan Cooke","raw_affiliation_strings":["University of Winnipeg, Manitoba, Canada","University of Winnipeg, Manitoba, Canada,"],"affiliations":[{"raw_affiliation_string":"University of Winnipeg, Manitoba, Canada","institution_ids":["https://openalex.org/I872945872"]},{"raw_affiliation_string":"University of Winnipeg, Manitoba, Canada,","institution_ids":["https://openalex.org/I872945872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5115602977"],"corresponding_institution_ids":["https://openalex.org/I872945872"],"apc_list":null,"apc_paid":null,"fwci":0.9053,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76520675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"450","last_page":"455"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/transitive-closure","display_name":"Transitive closure","score":0.867047905921936},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8025165796279907},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.6719779968261719},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5969059467315674},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5840434432029724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5665132403373718},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5527111291885376},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4614599347114563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4584767818450928},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4562983214855194},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4257239103317261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41697633266448975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40706154704093933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.392402321100235},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21650952100753784},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20539003610610962}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.867047905921936},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8025165796279907},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.6719779968261719},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5969059467315674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5840434432029724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5665132403373718},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5527111291885376},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4614599347114563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4584767818450928},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4562983214855194},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4257239103317261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41697633266448975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40706154704093933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.392402321100235},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21650952100753784},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20539003610610962}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1141277.1141385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1141277.1141385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W45000526","https://openalex.org/W144328805","https://openalex.org/W147240463","https://openalex.org/W198808598","https://openalex.org/W423069184","https://openalex.org/W1480049974","https://openalex.org/W1549212411","https://openalex.org/W1576103723","https://openalex.org/W1578447260","https://openalex.org/W1585853635","https://openalex.org/W1910272261","https://openalex.org/W1965109038","https://openalex.org/W1965253335","https://openalex.org/W1973623398","https://openalex.org/W1976177462","https://openalex.org/W1982842767","https://openalex.org/W1987927249","https://openalex.org/W1988615825","https://openalex.org/W1993504147","https://openalex.org/W2007908428","https://openalex.org/W2022843938","https://openalex.org/W2024491681","https://openalex.org/W2025194432","https://openalex.org/W2028198372","https://openalex.org/W2043190038","https://openalex.org/W2044439539","https://openalex.org/W2044701300","https://openalex.org/W2047783181","https://openalex.org/W2054633003","https://openalex.org/W2057354799","https://openalex.org/W2057552436","https://openalex.org/W2070992781","https://openalex.org/W2075209053","https://openalex.org/W2091980332","https://openalex.org/W2092251403","https://openalex.org/W2094553945","https://openalex.org/W2099624270","https://openalex.org/W2104586045","https://openalex.org/W2104734478","https://openalex.org/W2106439532","https://openalex.org/W2109097687","https://openalex.org/W2118382442","https://openalex.org/W2130135276","https://openalex.org/W2132063146","https://openalex.org/W2140678196","https://openalex.org/W2143676586","https://openalex.org/W2157086817","https://openalex.org/W2158655585","https://openalex.org/W2162064942","https://openalex.org/W2163169902","https://openalex.org/W2166669365","https://openalex.org/W2169486917","https://openalex.org/W2336493585","https://openalex.org/W2752061190","https://openalex.org/W4235794864","https://openalex.org/W4249783758","https://openalex.org/W4255993952","https://openalex.org/W6632976917","https://openalex.org/W6634903113"],"related_works":["https://openalex.org/W2044040096","https://openalex.org/W3139713485","https://openalex.org/W1978268649","https://openalex.org/W1578808377","https://openalex.org/W2021661549","https://openalex.org/W4297054060","https://openalex.org/W4247505235","https://openalex.org/W2171308818","https://openalex.org/W1690273063","https://openalex.org/W189043490"],"abstract_inverted_index":{"A":[0,99],"composite":[1],"object":[2],"represented":[3],"as":[4],"a":[5,57,63,78,102,105,112,151,178,207,222],"directed":[6],"graph":[7,91],"(digraph":[8],"for":[9,93,140,154,158,218],"short)":[10],"is":[11,33,75,101,109,210,232,240],"an":[12],"important":[13],"data":[14],"structure":[15],"that":[16,87,108],"requires":[17],"efficient":[18],"support":[19],"in":[20,39,90,110,163],"CAD/CAM,":[21],"CASE,":[22],"office":[23],"systems,":[24],"software":[25],"management,":[26],"web":[27],"databases,":[28],"and":[29,82,166,186,238],"document":[30],"databases.":[31],"It":[32],"cumbersome":[34],"to":[35,61,150,197,228],"handle":[36],"such":[37],"objects":[38],"relational":[40],"database":[41],"systems":[42],"when":[43],"they":[44],"involve":[45],"ancestor-descendant":[46],"relationships":[47],"(or":[48],"say,":[49],"recursive":[50,142],"relationships).":[51],"In":[52],"this":[53,204],"paper,":[54],"we":[55],"present":[56],"new":[58,152],"encoding":[59,128,205],"method":[60,74,81,192],"label":[62],"digraph,":[64],"which":[65,215],"reduces":[66],"the":[67,83,95,117,120,123,126,131,145,172,175,181,184,188,216,219,233,241,245],"footprints":[68],"of":[69,85,104,119,174,177,183,214,221,235,244],"all":[70,116,136],"previous":[71],"strategies.":[72],"This":[73],"based":[76,202],"on":[77,203],"tree":[79],"labeling":[80],"concept":[84],"branchings":[86],"are":[88],"used":[89],"theory":[92],"finding":[94],"shortest":[96],"connection":[97],"networks.":[98],"branching":[100],"subgraph":[103],"given":[106],"digraph":[107],"fact":[111],"forest,":[113],"but":[114],"covers":[115],"nodes":[118,176],"graph.":[121],"On":[122,144],"one":[124],"hand,":[125,147],"proposed":[127],"scheme":[129],"achieves":[130],"smallest":[132],"space":[133,217],"requirements":[134],"among":[135],"previously":[137],"published":[138],"strategies":[139],"recognizing":[141],"relationships.":[143],"other":[146],"it":[148],"leads":[149],"algorithm":[153],"computing":[155],"transitive":[156,223],"closures":[157],"DAGs":[159],"(directed":[160],"acyclic":[161],"graph)":[162],"O(e\u00b7b)":[164],"time":[165],"O(n\u00b7b)":[167],"space,":[168],"where":[169,230],"n":[170],"represents":[171],"number":[173,234],"DAG,":[179],"e":[180],"numbers":[182],"edges,":[185],"b":[187],"DAG's":[189],"breadth.":[190],"The":[191],"can":[193,225],"also":[194],"be":[195,226],"extended":[196],"graphs":[198],"containing":[199],"cycles.":[200],"Especially,":[201],"method,":[206],"multi-level":[208],"compression":[209,236],"developed,":[211],"by":[212],"means":[213],"representation":[220],"closure":[224],"reduced":[227],"O((b/dk)\u00b7n),":[229],"k":[231],"levels":[237],"d":[239],"average":[242],"outdegree":[243],"nodes.":[246]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}