On the red/blue spanning tree problem

DOI10.1016/j.tcs.2010.10.038zbMath1216.68116OpenAlexW2149317979MaRDI QIDQ534557

Sergey Bereg, Binhai Zhu, Boting Yang, Ming-Hui 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

zbMATH Keywords

spanning treecrossing numbercomputational geometry

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Short plane supports for spatial hypergraphs, Short Plane Supports for Spatial Hypergraphs

Cites Work

• How to draw a planar graph on a grid
• Planar bichromatic minimum spanning trees
• Crossing number is hard for cubic graphs
• Crossing Number is NP-Complete
• On the convex layers of a planar set
• Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item