Average case analysis of DJ graphs

DOI10.1016/j.jda.2005.07.002zbMath1109.68137OpenAlexW2090183091MaRDI QIDQ866551

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

average case analysisdata flow analysisDJ graphsdominance frontierdominator tree

Mathematics Subject Classification ID

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

Uses Software

• Modula

Cites Work

• Remarks on an asymptotic method in combinatorics
• Data-flow frameworks for worst-case execution time analysis
• On an asymptotic method in enumeration
• Asymptotic Methods in Enumeration
• Dominators in Linear Time
• Handbook of Graph Grammars and Computing by Graph Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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