Maximum plane trees in multipartite geometric graphs

DOI10.1007/s00453-018-0482-xzbMath1422.68182OpenAlexW4241946002MaRDI QIDQ5915987

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

Publication date: 25 April 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0482-x

zbMATH Keywords

approximation algorithmsmaximum spanning treesmultipartite geometric graphsplane spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Euclidean maximum matchings in the plane -- local to global ⋮ Planar Bichromatic Bottleneck Spanning Trees ⋮ On the longest spanning tree with neighborhoods

Cites Work

• Unnamed Item
• Long non-crossing configurations in the plane
• Computing Euclidean maximum spanning trees
• Planar bichromatic minimum spanning trees
• Spanning trees in multipartite geometric graphs

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