On the red/blue spanning tree problem
DOI10.1016/J.TCS.2010.10.038zbMATH Open1216.68116OpenAlexW2149317979MaRDI QIDQ534557FDOQ534557
Authors: Sergey Bereg, Boting Yang, Binhai Zhu, Minghui Jiang 
Publication date: 18 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.038
Recommendations
Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Crossing Number is NP-Complete
- Title not available (Why is that?)
- How to draw a planar graph on a grid
- Crossing number is hard for cubic graphs
- Title not available (Why is that?)
- On the convex layers of a planar set
- Planar bichromatic minimum spanning trees
- Algorithms and Computation
Cited In (11)
- Short plane supports for spatial hypergraphs
- On the Red/Blue Spanning Tree Problem
- Geometric spanning cycles in bichromatic point sets
- On the number of intersections of three monochromatic trees in the plane
- Planar bichromatic bottleneck spanning trees
- Geometric planar networks on bichromatic collinear points
- Planar Bichromatic Bottleneck Spanning Trees
- Colored spanning graphs for set visualization
- Colored spanning graphs for set visualization
- Short plane supports for spatial hypergraphs
- Faster algorithms for the minimum red-blue-purple spanning graph problem
This page was built for publication: On the red/blue spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534557)
