Computing Frequency Dominators and Related Problems

DOI10.1007/978-3-540-92182-0_62MaRDI QIDQ3596763zbMATH OpenOpenAlexFDO

Authors Loukas Georgiadis

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_62

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• Computing dominators in parallel
• Finding Dominators in Practice
• Algorithms – ESA 2004
• An experimental study of dynamic dominators
• Finding dominators revisited (extended abstract)

Cited in

(4)

• The power of frequency computation
• How difficult is the frequency selection problem?
• Structured Frequency Algorithms
• Optimal algorithm for the nearest common dominator problem

This page was built for publication: Computing Frequency Dominators and Related Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596763)