Spanning trees in multipartite geometric graphs

DOI10.1007/s00453-017-0375-4zbMath1410.68280arXiv1611.01661WikidataQ102071120 ScholiaQ102071120MaRDI QIDQ1755734

Anil Maheshwari, Prosenjit Bose, Pat Morin, David Eppstein, Ahmad Biniaz, Michiel H. M. Smid

Publication date: 11 January 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01661

zbMATH Keywords

minimum spanning tree; maximum spanning tree; multipartite geometric graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C85: Graph algorithms (graph-theoretic aspects)