Faster Algorithms for Incremental Topological Ordering

DOI10.1007/978-3-540-70575-8_35zbMath1153.05329OpenAlexW1513315626MaRDI QIDQ3521937

Bernhard Haeupler, Siddhartha Sen, Rogers Mathew, Telikepalli Kavitha, Robert Endre Tarjan

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_35

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Approximations of the Lagrange and Markov spectra ⋮ Average-case analysis of incremental topological ordering ⋮ Reallocation problems in scheduling

This page was built for publication: Faster Algorithms for Incremental Topological Ordering