Multi-colored spanning graphs
From MaRDI portal
Publication:784473
DOI10.1016/j.tcs.2020.04.022zbMath1451.68197arXiv1608.07056MaRDI QIDQ784473
Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth
Publication date: 3 August 2020
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07056
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
The Painter’s Problem: Covering a Grid with Colored Connected Polygons, On the double total dominator chromatic number of graphs, Short Plane Supports for Spatial Hypergraphs, Multi-colored spanning graphs, Short plane supports for spatial hypergraphs, Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Path-based supports for hypergraphs
- On multiaspect graphs
- Multi-colored spanning graphs
- On sparse spanners of weighted graphs
- Colored spanning graphs for set visualization
- Spanning trees in multipartite geometric graphs
- On some geometric problems of color-spanning sets
- Colored Spanning Graphs for Set Visualization
- New and improved spanning ratios for Yao graphs
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
- Geometric Spanner Networks
- Subdivision Drawings of Hypergraphs
- Hypergraph planarity and the complexity of drawing venn diagrams
- The Problem of Compatible Representatives
- Tverberg’s theorem is 50 years old: A survey
- Short Plane Supports for Spatial Hypergraphs
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Steiner Minimal Trees
