{"id":"https://openalex.org/W2055688322","doi":"https://doi.org/10.1145/2071379.2071382","title":"Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance","display_name":"Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2055688322","doi":"https://doi.org/10.1145/2071379.2071382","mag":"2055688322"},"language":"en","primary_location":{"id":"doi:10.1145/2071379.2071382","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2071379.2071382","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Tata Institute of Fundamental Research"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076736694","display_name":"Rogers Mathew","orcid":"https://orcid.org/0000-0003-4536-1136"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rogers Mathew","raw_affiliation_strings":["Indian Institute of Science","INDIAN INSTITUTE OF SCIENCE"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"INDIAN INSTITUTE OF SCIENCE","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103920769","display_name":"Siddhartha Sen","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha Sen","raw_affiliation_strings":["Princeton University","Princeton University#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]},{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University &amp; HP Laboratories"],"affiliations":[{"raw_affiliation_string":"Princeton University &amp; HP Laboratories","institution_ids":["https://openalex.org/I1324840837","https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":8.0871,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.98121455,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"8","issue":"1","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.9986000061035156,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.6934974193572998},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6809393167495728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5665279626846313},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5658676624298096},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.524002194404602},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5075169801712036},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.49031999707221985},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4734087884426117},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4710170030593872},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4684733748435974},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43572473526000977},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4227468967437744},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3724396824836731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36409586668014526}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6934974193572998},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6809393167495728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5665279626846313},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5658676624298096},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.524002194404602},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5075169801712036},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.49031999707221985},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4734087884426117},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4710170030593872},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4684733748435974},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43572473526000977},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4227468967437744},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3724396824836731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36409586668014526},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2071379.2071382","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2071379.2071382","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8776428821","display_name":null,"funder_award_id":"CCF-0830676CCF-0832797","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W75167454","https://openalex.org/W968309248","https://openalex.org/W1497373391","https://openalex.org/W1498578111","https://openalex.org/W1506695968","https://openalex.org/W1513315626","https://openalex.org/W1575239777","https://openalex.org/W1590822864","https://openalex.org/W1595776161","https://openalex.org/W1602103078","https://openalex.org/W1608728140","https://openalex.org/W1676865579","https://openalex.org/W1792966054","https://openalex.org/W1976080419","https://openalex.org/W1979867605","https://openalex.org/W1986022261","https://openalex.org/W1988846076","https://openalex.org/W1996641400","https://openalex.org/W2008593246","https://openalex.org/W2016000144","https://openalex.org/W2021751455","https://openalex.org/W2026511056","https://openalex.org/W2028782479","https://openalex.org/W2044146725","https://openalex.org/W2045102550","https://openalex.org/W2060607751","https://openalex.org/W2065482951","https://openalex.org/W2067893166","https://openalex.org/W2068283945","https://openalex.org/W2075410688","https://openalex.org/W2084763084","https://openalex.org/W2085201606","https://openalex.org/W2086852413","https://openalex.org/W2090747326","https://openalex.org/W2097490969","https://openalex.org/W2104685510","https://openalex.org/W2118382442","https://openalex.org/W2149757010","https://openalex.org/W2150138144","https://openalex.org/W2152506638","https://openalex.org/W2154203836","https://openalex.org/W2273959428","https://openalex.org/W2321452898","https://openalex.org/W2752853835","https://openalex.org/W2753176400","https://openalex.org/W2799349239","https://openalex.org/W3031415405","https://openalex.org/W4233015194","https://openalex.org/W4238798236","https://openalex.org/W6629686324","https://openalex.org/W6744529318","https://openalex.org/W6820659958"],"related_works":["https://openalex.org/W1994598067","https://openalex.org/W4367665025","https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491","https://openalex.org/W2018076478","https://openalex.org/W4309397562"],"abstract_inverted_index":{"We":[0,167],"present":[1],"two":[2],"online":[3],"algorithms":[4,71,172],"for":[5],"maintaining":[6],"a":[7,11,23,59,67,73,105,136],"topological":[8],"order":[9],"of":[10,84,138,143,170,176],"directed":[12],"n":[13,48,89,123,128,153,156],"-vertex":[14],"acyclic":[15],"graph":[16],"as":[17],"arcs":[18],"are":[19],"added,":[20],"and":[21,62,165],"detecting":[22],"cycle":[24],"when":[25],"one":[26],"is":[27,63],"created.":[28],"Our":[29,77,108],"first":[30],"algorithm":[31,79,119,149],"handles":[32,80],"m":[33,38,46],"arc":[34,85],"additions":[35,86],"in":[36,87,151],"O(":[37,88],"3/2":[39],")":[40,91,129,157],"time.":[41,92],"For":[42,93],"sparse":[43],"graphs":[44],"(":[45],"/":[47],"=":[49],"O(1)),":[50],"this":[51,97],"bound":[52,57,98,103,109],"improves":[53,99],"the":[54,100,118,139,174,181],"best":[55,101],"previous":[56,102],"by":[58,104,131,162],"logarithmic":[60],"factor,":[61],"tight":[64],"to":[65,135,173],"within":[66],"constant":[68],"factor":[69],"among":[70],"satisfying":[72],"natural":[74],"locality":[75],"property.":[76],"second":[78],"an":[81],"arbitrary":[82],"sequence":[83],"5/2":[90],"sufficiently":[94],"dense":[95],"graphs,":[96],"polynomial":[106],"factor.":[107],"may":[110],"be":[111],"far":[112],"from":[113],"tight:":[114],"we":[115],"show":[116],"that":[117],"can":[120],"take":[121],"\u03a9(":[122],"2":[124,125,154],"\u221a2":[126],"lg":[127],"time":[130,158,183],"relating":[132],"its":[133],"performance":[134],"generalization":[137],"k":[140],"-levels":[141],"problem":[142],"combinatorial":[144],"geometry.":[145],"A":[146],"completely":[147],"different":[148],"running":[150],"\u0398(":[152],"log":[155],"was":[159],"given":[160],"recently":[161],"Bender,":[163],"Fineman,":[164],"Gilbert.":[166],"extend":[168],"both":[169],"our":[171],"maintenance":[175],"strong":[177],"components,":[178],"without":[179],"affecting":[180],"asymptotic":[182],"bounds.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
