Are there any Matroid Intersection programs on graphs?
2 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
I have a graph which is colored and those colors are the weights on the edges. I want to perform matroid intersection which takes in input graphic matroid(all possible acyclic combinations of the edges) and partition matroid (of the colors/weights which are integers) and performs the intersection. I found a matlab code on Matroid Intersection online but I am confused on how to use it.
Kindly let me know if there is any software to do this.
0 Commenti
Risposte (1)
Vaibhav
il 6 Ott 2023
Hi Mihir
I understand that you are looking for matroid intersection programs on graphs.
For matroid intersection algorithms, you can explore the documentation available on File Exchange at the following link:
There is a minor issue with the code, Single "end" is missing at the end of the program.
Also, to use the function at the given link you can use the below example for the reference.
% Define the graph and its weights
E = [1 2 3 4 5];
S1 = [1 0 1 0 1; 1 0 1 1 0];
S2 = [1 0 1 0 0; 0 1 0 1 0; 0 0 0 0 1];
% Call the MatroidIntersection function
I = MatroidIntersection(E, S1, S2);
% Display the result
disp(I);
Hope this helps!
Regards,
Vaibhav
0 Commenti
Vedere anche
Categorie
Scopri di più su 2-D and 3-D Plots in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!