An asymptotic study for path reversal.

DOI10.1016/S0304-3975(02)00537-6zbMath1042.68093MaRDI QIDQ1874412

Alain Giorgetti

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Markov chainStationary distributionAverage-case complexityRooted treePath reversal

Mathematics Subject Classification ID

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

Cites Work

• A tight amortized bound for path reversal
• Worst-case Analysis of Set Union Algorithms
• Markov Chains
• Unnamed Item
• Unnamed Item

This page was built for publication: An asymptotic study for path reversal.