Enumerating the \(k\) best plane spanning trees

DOI10.1016/S0925-7721(00)00029-8zbMath0976.68161OpenAlexW2007319196MaRDI QIDQ5931369

Ambros Marzetta, Jurg Nievergelt

Publication date: 2 January 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00029-8

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• ZRAM

Cites Work

• The parallel search bench ZRAM and its applications
• Reverse search for enumeration
• Thek best spanning arborescences of a network
• An Algorithm for Finding K Minimum Spanning Trees
• Two Algorithms for Generating Weighted Spanning Trees in Order