Efficient generation of elimination trees and graph associahedra

DOI10.1137/1.9781611977073.84MaRDI QIDQ6575158

Arturo I. Merino, Torsten Mütze, Jean Cardinal

Publication date: 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Combinatorial generation via permutation languages. VI: Binary trees

This page was built for publication: Efficient generation of elimination trees and graph associahedra

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