Faster algorithms for the minimum red-blue-purple spanning graph problem

DOI10.7155/JGAA.00427MaRDI QIDQ2985117zbMATH OpenOpenAlexFDO

Authors Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel Smid

Publication date 16 May 2017

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00427

zbMATH Keywords

minimum RBP spanning graph problemRBP spanning graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Colored spanning graphs for set visualization
• Colored spanning graphs for set visualization
• Planar bichromatic minimum spanning trees
• On the Red/Blue Spanning Tree Problem
• On the red/blue spanning tree problem

Cites work

• Colored spanning graphs for set visualization
• Colored spanning graphs for set visualization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 3299324 (Why is no real title available?)
• MapSets: visualizing embedded and clustered graphs
• On planar supports for hypergraphs
• Path-based supports for hypergraphs
• Quasi-planar graphs have a linear number of edges
• Subdivision Drawings of Hypergraphs

Cited in

(3)

• Colored spanning graphs for set visualization
• Colored spanning graphs for set visualization
• A better heuristic algorithm for finding the closest trio of 3-colored points from a given set of 3-colored points on a plane

Describes a project that uses

Uses Software

• MapSets

This page was built for publication: Faster algorithms for the minimum red-blue-purple spanning graph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985117)