On the Red/Blue Spanning Tree Problem

DOI10.1007/978-3-642-02017-9_15MaRDI QIDQ3630196zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Boting Yang, Binhai Zhu, Minghui Jiang

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_15

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the red/blue spanning tree problem
• On the SPANNING k-TREE problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The color-balanced spanning tree problem.
• On the minimum diameter spanning tree problem
• The \textsc{red-blue separation} problem on graphs
• The \textsc{Red-Blue Separation} problem on graphs
• scientific article; zbMATH DE number 1285634
• A solution of Chartrand's problem on spanning trees
• On spanning tree congestion of graphs

Cited in

(8)

• Intersection number of two connected geometric graphs
• Geometric spanning cycles in bichromatic point sets
• Geometric planar networks on bichromatic collinear points
• Faster algorithms for the minimum red-blue-purple spanning graph problem
• On the red/blue spanning tree problem
• On the number of intersections of three monochromatic trees in the plane
• Maximum plane trees in multipartite geometric graphs
• Maximum plane trees in multipartite geometric graphs

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 Q3630196)