Maximum Plane Trees in Multipartite Geometric Graphs

A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane such that R ∪ B is in general...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 4; pp. 1512 - 1534
Main Authors:	Biniaz, Ahmad, Bose, Prosenjit, Crosbie, Kimberly, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Smid, Michiel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Approximation Computation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Decision trees Ethernet Graph theory Mathematical analysis Mathematics of Computing Theory of Computation Trees (mathematics) Multipartite geometric graphs Approximation algorithms Plane spanning trees Maximum spanning trees
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!