I have a colored graph (weights are colors with integers) which is based out of a power system. I want to perform matroid intersection on this graph which takes in two constraints:
The ground set is the set of the edges of the graph.
1). Graphic Matroids: All possible acyclic combinations of the edges in the graph( starting with small cardinality to largest cardinality)
2)Partition Matroids: This is formed from the colors of the edges.
Please let me know if there are any codes/algorithms which would perform the aforementioned constraints.
Attached is my graph where the edges are labelled with weights(numerical colors).
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs
More Mihir Malladi's questions See All
Similar questions and discussions