{"id":"https://openalex.org/W1558383352","doi":"https://doi.org/10.1145/2756553","title":"A New Approach to Incremental Cycle Detection and Related Problems","display_name":"A New Approach to Incremental Cycle Detection and Related Problems","publication_year":2015,"publication_date":"2015-12-08","ids":{"openalex":"https://openalex.org/W1558383352","doi":"https://doi.org/10.1145/2756553","mag":"1558383352"},"language":"en","primary_location":{"id":"doi:10.1145/2756553","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2756553","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/A5068761590","display_name":"Michael A. Bender","orcid":"https://orcid.org/0000-0001-7639-530X"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, Washington, DC","Georgetown University , Washington, DC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC","institution_ids":["https://openalex.org/I184565670"]},{"raw_affiliation_string":"Georgetown University , Washington, DC","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042520814","display_name":"Seth Gilbert","orcid":"https://orcid.org/0000-0003-3298-7412"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Seth Gilbert","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University and Intertrust Technologies, Sunnyvale, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University and Intertrust Technologies, Sunnyvale, CA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9611,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.96349415,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9915000200271606,"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/combinatorics","display_name":"Combinatorics","score":0.6845674514770508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566784739494324},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5443418025970459},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5298585295677185},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5213678479194641},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4706168472766876},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47043368220329285},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4495837986469269},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44928833842277527},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44700032472610474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39167314767837524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3359816074371338},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20074182748794556}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6845674514770508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566784739494324},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5443418025970459},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5298585295677185},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5213678479194641},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4706168472766876},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47043368220329285},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4495837986469269},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44928833842277527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44700032472610474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39167314767837524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3359816074371338},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20074182748794556},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2756553","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2756553","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W968309248","https://openalex.org/W1513315626","https://openalex.org/W1513400187","https://openalex.org/W1519800400","https://openalex.org/W1546014544","https://openalex.org/W1549024371","https://openalex.org/W1608728140","https://openalex.org/W1676865579","https://openalex.org/W1986022261","https://openalex.org/W1993449345","https://openalex.org/W2008593246","https://openalex.org/W2010802092","https://openalex.org/W2016000144","https://openalex.org/W2026511056","https://openalex.org/W2044146725","https://openalex.org/W2045102550","https://openalex.org/W2049105156","https://openalex.org/W2051049045","https://openalex.org/W2055688322","https://openalex.org/W2060607751","https://openalex.org/W2063123613","https://openalex.org/W2068283945","https://openalex.org/W2069916913","https://openalex.org/W2084763084","https://openalex.org/W2086852413","https://openalex.org/W2097490969","https://openalex.org/W2104685510","https://openalex.org/W2118382442","https://openalex.org/W2120243711","https://openalex.org/W2150138144","https://openalex.org/W2156167308","https://openalex.org/W2321452898","https://openalex.org/W2326587081","https://openalex.org/W2799349239","https://openalex.org/W3198160809","https://openalex.org/W3198470706","https://openalex.org/W4240200084","https://openalex.org/W4251146767"],"related_works":["https://openalex.org/W2892180138","https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4389362338","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,18,27,46,75,118,151,154],"problem":[3],"of":[4,21,30,107,113,123,153],"detecting":[5],"a":[6,9,23,32,93],"cycle":[7],"in":[8],"directed":[10],"graph":[11],"that":[12],"grows":[13],"by":[14],"arc":[15],"insertions":[16],"and":[17,26],"related":[19],"problems":[20],"maintaining":[22],"topological":[24,144],"order":[25],"strong":[28],"components":[29],"such":[31],"graph.":[33],"For":[34],"these":[35],"problems,":[36],"we":[37,146],"give":[38,156],"two":[39],"algorithms,":[40],"one":[41],"suited":[42],"to":[43,48,66],"sparse":[44,87],"graphs,":[45],"other":[47],"dense":[49,115,130],"graphs.":[50,131],"The":[51,110],"former":[52],"takes":[53,77],"O":[54,78,95,124],"(min":[55],"{":[56],"m":[57,63,68,97],"1/2":[58],",":[59],"n":[60,72,80,83,126],"2/3":[61],"}":[62],")":[64,84,128],"time":[65,111,121],"insert":[67],"arcs":[69],"into":[70],"an":[71],"-vertex":[73],"graph;":[74],"latter":[76],"(":[79,96,125],"2":[81],"log":[82],"time.":[85,160],"Our":[86,132],"algorithm":[88,116],"is":[89,102],"substantially":[90],"simpler":[91],"than":[92],"previous":[94],"3/2":[98],")-time":[99],"algorithm;":[100],"it":[101],"also":[103],"faster":[104],"on":[105,138,150,158],"graphs":[106],"sufficient":[108],"density.":[109],"bound":[112,122],"our":[114],"beats":[117],"previously":[119],"best":[120],"5/2":[127],"for":[129,135],"algorithms":[133],"rely":[134],"their":[136],"efficiency":[137],"vertex":[139],"numberings":[140],"weakly":[141],"consistent":[142],"with":[143],"order:":[145],"allow":[147],"ties.":[148],"Bounds":[149],"size":[152],"numbers":[155],"bounds":[157],"running":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}