I have a connected-undirected and unweighted graph that edges are colored with red and blue. Looking for an algorithm that find spanning tree wiht maximum blue edges in polynomial-time.
Asked
Active
Viewed 19 times
