An O(| V|^*| E|) algorithm for finding immediate multiple-vertex dominators

DOI10.1016/0020-0190(96)00085-3MaRDI QIDQ1847358zbMATH OpenOpenAlexFDO

Authors Stephen Alstrup, Jens Clausen, Kristian Jørgensen

Publication date 24 June 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00085-3

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for prescribed multiple domination in arbitrary graphs
• On the algorithmic complexity of double vertex-edge domination in graphs
• Double vertex-edge domination in graphs: complexity and algorithms
• Total vertex-edge domination in graphs: Complexity and algorithms
• An efficient algorithm for the configuration problem of dominance graphs
• k-Efficient domination: Algorithmic perspective
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• On the approximability and exact algorithms for vector domination and related problems in graphs
• On efficient dominating sets in simplicial graphs
• Algorithmic aspects of \(\mathcal{F}\)-domination in graphs

Cites work

• A fast algorithm for finding dominators in a flowgraph
• A Simple Algorithm for Global Data Flow Analysis Problems
• Finding Dominators in Directed Graphs
• Generalized dominators

Cited in

(1)

• Generalized dominators for structured programs

This page was built for publication: An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators

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