{"id":"https://openalex.org/W2026154596","doi":"https://doi.org/10.1145/1227161.1370597","title":"An experimental study of algorithms for fully dynamic transitive closure","display_name":"An experimental study of algorithms for fully dynamic transitive closure","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2026154596","doi":"https://doi.org/10.1145/1227161.1370597","mag":"2026154596"},"language":"en","primary_location":{"id":"doi:10.1145/1227161.1370597","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1227161.1370597","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","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/A5056137063","display_name":"Ioannis Krommidas","orcid":null},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Ioannis Krommidas","raw_affiliation_strings":["CTI and University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"CTI and University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Zaroliagis","raw_affiliation_strings":["CTI and University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"CTI and University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056137063"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":1.2016,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.79483133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9958999752998352,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9905999898910522,"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.8283142447471619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6458047032356262},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5953640937805176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5845426321029663},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5563981533050537},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.5075961351394653},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4919288158416748},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.4162556827068329},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4146724343299866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2853773832321167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16977977752685547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13168981671333313},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06340271234512329}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8283142447471619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6458047032356262},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5953640937805176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5845426321029663},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5563981533050537},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.5075961351394653},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4919288158416748},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4162556827068329},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4146724343299866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2853773832321167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16977977752685547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13168981671333313},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06340271234512329},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1227161.1370597","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1227161.1370597","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G899066895","display_name":null,"funder_award_id":"IST-2002-001907FP6-021235-2","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W48660803","https://openalex.org/W1512043027","https://openalex.org/W1554407673","https://openalex.org/W1601919219","https://openalex.org/W1646421132","https://openalex.org/W1847690346","https://openalex.org/W1855284371","https://openalex.org/W1969485351","https://openalex.org/W1976177462","https://openalex.org/W1991778515","https://openalex.org/W1992595637","https://openalex.org/W2004317773","https://openalex.org/W2014881855","https://openalex.org/W2026187504","https://openalex.org/W2028507750","https://openalex.org/W2032075690","https://openalex.org/W2037034819","https://openalex.org/W2044040096","https://openalex.org/W2069938443","https://openalex.org/W2084888995","https://openalex.org/W2097490969","https://openalex.org/W2099450374","https://openalex.org/W2116633957","https://openalex.org/W2139666321","https://openalex.org/W2148411689","https://openalex.org/W2156153879","https://openalex.org/W2610955095","https://openalex.org/W2905110430","https://openalex.org/W4285719527","https://openalex.org/W6601941393","https://openalex.org/W6613305977"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W2123627450","https://openalex.org/W4230967508","https://openalex.org/W203725150","https://openalex.org/W1499233953"],"abstract_inverted_index":{"We":[0,14,61],"have":[1,15],"conducted":[2],"an":[3],"extensive":[4],"experimental":[5],"study":[6,56],"on":[7,67,74],"algorithms":[8,21,51,88],"for":[9],"fully":[10,19,47],"dynamic":[11,20,48,87],"transitive":[12],"closure.":[13],"implemented":[16],"the":[17,86],"recent":[18],"by":[22,77],"King":[23],"[1999],":[24],"Roditty":[25,27],"[2003],":[26],"and":[28,32,34,42,49,63,73],"Zwick":[29],"[2002,":[30],"2004],":[31],"Demetrescu":[33],"Italiano":[35],"[2000,":[36],"2005]":[37],"along":[38],"with":[39],"several":[40],"variants":[41],"compared":[43,64],"them":[44],"to":[45],"pseudo":[46],"simple-minded":[50],"developed":[52],"in":[53,95],"a":[54],"previous":[55],"[Frigioni":[57],"et":[58],"al.":[59],"2001].":[60],"tested":[62],"these":[65],"implementations":[66],"random":[68],"inputs,":[69,72],"synthetic":[70],"(worst-case)":[71],"inputs":[75],"motivated":[76],"real-world":[78],"graphs.":[79],"Our":[80],"experiments":[81],"reveal":[82],"that":[83],"some":[84],"of":[85,92],"can":[89],"really":[90],"be":[91],"practical":[93],"value":[94],"many":[96],"situations.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}