Bounded contractions of full trees

DOI10.1006/JPDC.1993.1035MaRDI QIDQ2365583zbMATH OpenOpenAlexFDO

Authors Ron Ben-Natan, Amnon Barak

Publication date 29 June 1993

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1993.1035

zbMATH Keywords

bounded contractionsfull treesparallel programs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3950554
• Parallel Tree Contraction Part 2: Further Applications
• Graph contraction pattern matching for graphs of bounded treewidth
• Non-expanding mappings in graphs

Cited in

(1)

• scientific article; zbMATH DE number 3950554 (Why is no real title available?)

This page was built for publication: Bounded contractions of full trees

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