Colored spanning graphs for set visualization

DOI10.1007/978-3-319-03841-4_25zbMATH Open1406.68084OpenAlexW2101928287MaRDI QIDQ2867665FDOQ2867665

Authors: Ferran Hurtado, Maarten Löffler, Vera Sacristán, Rodrigo I. Silveira, Bettina Speckmann, Matias Korman, Marc Van Kreveld 

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_25

Recommendations

• Colored spanning graphs for set visualization
• Faster algorithms for the minimum red-blue-purple spanning graph problem
• On the red/blue spanning tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (3)

• The painter's problem: covering a grid with colored connected polygons
• Colored spanning graphs for set visualization
• Faster algorithms for the minimum red-blue-purple spanning graph problem

This page was built for publication: Colored spanning graphs for set visualization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867665)