Enumerating Constrained Non-crossing Geometric Spanning Trees

DOI10.1007/978-3-540-73545-8_25zbMath1206.05098OpenAlexW1531999616WikidataQ29304964 ScholiaQ29304964MaRDI QIDQ3608849

Shin-ichi Tanigawa, Naoki Katoh

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_25

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Enumerating Constrained Non-crossing Geometric Spanning Trees