{"id":"https://openalex.org/W1577378583","doi":"https://doi.org/10.1145/1159892.1159896","title":"Online topological ordering","display_name":"Online topological ordering","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W1577378583","doi":"https://doi.org/10.1145/1159892.1159896","mag":"1577378583"},"language":"en","primary_location":{"id":"doi:10.1145/1159892.1159896","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159896","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":true,"oa_status":"green","oa_url":"http://dspace.library.uu.nl:8080/handle/1874/22170","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028865873","display_name":"Irit Katriel","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Irit Katriel","raw_affiliation_strings":["BRICS, University of Aarhus, \u00c5rhus, Denmark"],"affiliations":[{"raw_affiliation_string":"BRICS, University of Aarhus, \u00c5rhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands","Utrecht University \u2013 Utrecht, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University \u2013 Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028865873"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05820868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"3","first_page":"364","last_page":"379"},"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.9991999864578247,"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.9991999864578247,"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.9990000128746033,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6460198163986206},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6013946533203125},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.5753473043441772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5608993768692017},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5547705888748169},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5238944292068481},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.49528852105140686},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4725855588912964},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.46274474263191223},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4564104676246643},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43390509486198425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3724876046180725},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17130783200263977},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11363977193832397}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6460198163986206},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6013946533203125},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.5753473043441772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5608993768692017},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5547705888748169},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5238944292068481},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.49528852105140686},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4725855588912964},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.46274474263191223},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4564104676246643},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43390509486198425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3724876046180725},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17130783200263977},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11363977193832397}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/1159892.1159896","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159896","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"},{"id":"pmh:oai:pure.atira.dk:publications/a0cd9210-d3c0-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/a0cd9210-d3c0-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Katriel, I & Bodlaender, H L 2006, 'Online Topological Ordering', A C M Transactions on Algorithms, vol. 2, no. 3, pp. 364-379.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.7933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.7933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-011.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.library.uu.nl:1874/22170","is_oa":true,"landing_page_url":"http://dspace.library.uu.nl:8080/handle/1874/22170","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"},{"id":"pmh:oai:edoc.mpg.de:279191","is_oa":false,"landing_page_url":"http://edoc.mpg.de/279191","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), SIAM, 443-450 (2005)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1329008","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-2730-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/22170","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/22170","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"UU-CS, 2005-011. Utrecht University","raw_type":"info:eu-repo/semantics/other"},{"id":"mag:1577398132","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1329008","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null},{"id":"mag:2151543040","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/soda/soda2005.html#KatrielB05","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":{"id":"pmh:oai:dspace.library.uu.nl:1874/22170","is_oa":true,"landing_page_url":"http://dspace.library.uu.nl:8080/handle/1874/22170","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1608728140","https://openalex.org/W1988846076","https://openalex.org/W2008593246","https://openalex.org/W2026511056","https://openalex.org/W2029448190","https://openalex.org/W2049354208","https://openalex.org/W2065169094","https://openalex.org/W2084224084","https://openalex.org/W2087083200","https://openalex.org/W2118382442"],"related_works":["https://openalex.org/W2151543040","https://openalex.org/W3144947242","https://openalex.org/W2963924681","https://openalex.org/W2515993118","https://openalex.org/W2080488179","https://openalex.org/W2042373356","https://openalex.org/W3000941460","https://openalex.org/W2476017094","https://openalex.org/W2102347446","https://openalex.org/W2611562969","https://openalex.org/W2950456228","https://openalex.org/W2977205563","https://openalex.org/W1876661458","https://openalex.org/W2964755701","https://openalex.org/W2049800808","https://openalex.org/W1992869351","https://openalex.org/W2951135292","https://openalex.org/W88197230","https://openalex.org/W653534090","https://openalex.org/W3048914833"],"abstract_inverted_index":{"It":[0],"is":[1,113],"shown":[2],"that":[3,78,95],"the":[4,8,12,46,59,62,68,72,79,121],"problem":[5],"of":[6,11,14,50,61,71],"maintaining":[7],"topological":[9],"order":[10],"nodes":[13],"a":[15],"directed":[16],"acyclic":[17],"graph":[18],"while":[19],"inserting":[20],"m":[21,29,34],"edges":[22],"can":[23,97],"be":[24,98],"solved":[25],"in":[26,82,102,120],"O":[27,51,84,103],"(min{":[28],"3/2":[30,35],"log":[31,39,87,106],"n":[32,37,40,89,105,107],",":[33],"+":[36],"2":[38,88],"})":[41],"time,":[42],"an":[43],"improvement":[44],"over":[45],"best":[47],"known":[48],"result":[49],"(":[52,85,104],"mn":[53],").":[54],"In":[55],"addition,":[56],"we":[57],"analyze":[58],"complexity":[60],"same":[63],"algorithm":[64,80,116],"with":[65],"respect":[66],"to":[67,100],"treewidth":[69],"k":[70,93],"underlying":[73],"undirected":[74],"graph.":[75],"We":[76],"show":[77],"runs":[81],"time":[83,109],"mk":[86],")":[90,108],"for":[91],"general":[92],"and":[94],"it":[96],"implemented":[99],"run":[101],"on":[110],"trees,":[111],"which":[112],"optimal.":[114],"The":[115],"also":[117],"detects":[118],"cycles":[119],"input.":[122]},"counts_by_year":[],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}