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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 81; H. 4; S. 1512 - 1534
Hauptverfasser:	Biniaz, Ahmad, Bose, Prosenjit, Crosbie, Kimberly, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Smid, Michiel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2019 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!