The Serial Transitive Closure Problem for Trees

DOI10.1137/S0097539792225303zbMath0828.68099OpenAlexW1966418929MaRDI QIDQ4326856

Maria Luisa Bonet, Samuel R. Buss

Publication date: 27 March 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792225303

zbMATH Keywords

graph algorithmweak superconcentratorsserial transitive closure problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Shortcutting directed and undirected networks with a degree constraint ⋮ Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss

This page was built for publication: The Serial Transitive Closure Problem for Trees