Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

DOI10.7155/jgaa.00427zbMath1361.05125OpenAlexW2604563026MaRDI QIDQ2985117

Prosenjit Bose, Ahmad Biniaz, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid

Publication date: 16 May 2017

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

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)

Related Items (1)

Multi-colored spanning graphs

Uses Software

• MapSets

Cites Work

• Unnamed Item
• Path-based supports for hypergraphs
• Multi-colored spanning graphs
• Quasi-planar graphs have a linear number of edges
• Colored spanning graphs for set visualization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Colored Spanning Graphs for Set Visualization
• Subdivision Drawings of Hypergraphs
• On Planar Supports for Hypergraphs
• MapSets: Visualizing Embedded and Clustered Graphs

This page was built for publication: Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem