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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 81; číslo 4; s. 1512 - 1534
Hlavní autori:	Biniaz, Ahmad, Bose, Prosenjit, Crosbie, Kimberly, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Smid, Michiel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!