Colored spanning graphs for set visualization
From MaRDI portal
Publication:1699297
DOI10.1016/j.comgeo.2017.06.006zbMath1380.05065arXiv1603.00580OpenAlexW2730996427WikidataQ59782220 ScholiaQ59782220MaRDI QIDQ1699297
Matias Korman, Rodrigo I. Silveira, Maarten Löffler, Ferran Hurtado, Vera Sacristán, Takeshi Tokuyama, Akiyoshi Shioura, Bettina Speckmann, Marc J. van Kreveld
Publication date: 19 February 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00580
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The Minimum Moving Spanning Tree Problem ⋮ The minimum moving spanning tree problem ⋮ Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem ⋮ Short plane supports for spatial hypergraphs ⋮ Short Plane Supports for Spatial Hypergraphs ⋮ Multi-colored spanning graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path-based supports for hypergraphs
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Planar bichromatic minimum spanning trees
- Euclidean minimum spanning trees and bichromatic closest pairs
- Intersection number of two connected geometric graphs
- Chromatic nearest neighbor searching: A query sensitive approach
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Colored Spanning Graphs for Set Visualization
- Research Problems in Discrete Geometry
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Subdivision Drawings of Hypergraphs
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Steiner Minimal Trees
- On Planar Supports for Hypergraphs
