Publication:784473: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Multi-colored spanning graphs to Multi-colored spanning graphs: Duplicate |
(No difference)
| |
Latest revision as of 15:36, 29 April 2024
DOI10.1016/j.tcs.2020.04.022zbMath1451.68197arXiv1608.07056OpenAlexW3023791901MaRDI 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
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
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
