Maximum plane trees in multipartite geometric graphs

From MaRDI portal

Revision as of 20:13, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5920099

Jump to:navigation, search

DOI10.1007/978-3-319-62127-2_17zbMath1491.68137OpenAlexW2731236293MaRDI QIDQ5920099

Prosenjit Bose, Anil Maheshwari, Jean-Lou De Carufel, David Eppstein, Ahmad Biniaz, Michiel H. M. Smid, Kimberly Crosbie

Publication date: 22 September 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-62127-2_17

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

This page was built for publication: Maximum plane trees in multipartite geometric graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5920099&oldid=15047418"