Enumerating Constrained Non-crossing Geometric Spanning Trees
DOI10.1007/978-3-540-73545-8_25zbMATH Open1206.05098DBLPconf/cocoon/KatohT07OpenAlexW1531999616WikidataQ29304964 ScholiaQ29304964MaRDI QIDQ3608849FDOQ3608849
Authors: Naoki Katoh, Shin-Ichi Tanigawa 
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
Recommendations
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- scientific article; zbMATH DE number 7771742
- Memory-efficient enumeration of constrained spanning trees
- Enumeration of spanning trees of certain graphs
- scientific article; zbMATH DE number 1086911
- Spanning tree enumeration and nearly triangular graph Laplacians
- An improved lower bound on the maximum number of non-crossing spanning trees
- Fast enumeration algorithms for non-crossing geometric graphs
- Fast enumeration algorithms for non-crossing geometric graphs
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Enumeration in graph theory (05C30)
Cited In (5)
- Title not available (Why is that?)
- Enumerating the \(k\) best plane spanning trees
- Enumerating constrained non-crossing minimally rigid frameworks
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
This page was built for publication: Enumerating Constrained Non-crossing Geometric Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608849)
