Average case analysis of DJ graphs

DOI10.1016/J.JDA.2005.07.002MaRDI QIDQ866551zbMATH OpenOpenAlexFDO

Authors Johann Blieberger

Publication date 14 February 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2005.07.002

zbMATH Keywords

data flow analysisaverage case analysisDJ graphsdominance frontierdominator tree

Mathematics Subject Classification ID

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

Recommendations

• A Fast and Usually Linear Algorithm for Global Flow Analysis
• scientific article; zbMATH DE number 2087560
• scientific article; zbMATH DE number 3845083
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 3885296

Cites work

• scientific article; zbMATH DE number 3810889 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3541864 (Why is no real title available?)
• scientific article; zbMATH DE number 1142298 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Asymptotic Methods in Enumeration
• Data-flow frameworks for worst-case execution time analysis
• Dominators in Linear Time
• Finding dominators revisited (extended abstract)
• Handbook of Graph Grammars and Computing by Graph Transformation
• On an asymptotic method in enumeration
• Remarks on an asymptotic method in combinatorics

Cited in

(1)

• A Fast and Usually Linear Algorithm for Global Flow Analysis

Describes a project that uses

Uses Software

• Modula

This page was built for publication: Average case analysis of DJ graphs

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