ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Sat, 11 Aug 2018 03:59:26 +0200Find all maximum matchings in a bipartite graph. And how to relabel edges of a bipartite graph in sage?https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/ I want to find all the maximum matchings in a bipartite graph using sage, an algorithm is given in "Finding all maximally-matchable edges in a bipartite graph " by Tamir Tassa.
Also, I want to relabel the edges of my bipartite graph from 0,1,2,.. to y_1, y_2, x_1,.. ,x_1 (dot),...Sun, 13 May 2018 13:31:12 +0200https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/Comment by tmonteil for <p>I want to find all the maximum matchings in a bipartite graph using sage, an algorithm is given in "Finding all maximally-matchable edges in a bipartite graph " by Tamir Tassa.
Also, I want to relabel the edges of my bipartite graph from 0,1,2,.. to y_1, y_2, x_1,.. ,x_1 (dot),...</p>
https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=42344#post-id-42344What have you tried ?Tue, 15 May 2018 00:14:47 +0200https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=42344#post-id-42344Comment by dan_fulea for <p>I want to find all the maximum matchings in a bipartite graph using sage, an algorithm is given in "Finding all maximally-matchable edges in a bipartite graph " by Tamir Tassa.
Also, I want to relabel the edges of my bipartite graph from 0,1,2,.. to y_1, y_2, x_1,.. ,x_1 (dot),...</p>
https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=42433#post-id-42433Please initialize a graph, at least. Potential helpers can thus get started. (It would be a big favour if somebody finds, reads the cited text, implements it (in all possible relevant cases). So please come as much as possible with hints, and with a concrete description.)
Relabeling is simpler, e.g.
sage: G = graphs.PetersenGraph()
sage: G.vertices()
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
sage: G.relabel( dict( [ (j, 'y_%s'%j ) for j in range(10) ] ) )
sage: G
Petersen graph: Graph on 10 vertices
sage: G.vertices()
['y_0', 'y_1', 'y_2', 'y_3', 'y_4', 'y_5', 'y_6', 'y_7', 'y_8', 'y_9']Fri, 25 May 2018 03:24:36 +0200https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=42433#post-id-42433Comment by kcrisman for <p>I want to find all the maximum matchings in a bipartite graph using sage, an algorithm is given in "Finding all maximally-matchable edges in a bipartite graph " by Tamir Tassa.
Also, I want to relabel the edges of my bipartite graph from 0,1,2,.. to y_1, y_2, x_1,.. ,x_1 (dot),...</p>
https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=43325#post-id-43325Also asked at https://stackoverflow.com/questions/50260160/installed-sage-package-but-coundnt-useSat, 11 Aug 2018 03:59:26 +0200https://ask.sagemath.org/question/42324/find-all-maximum-matchings-in-a-bipartite-graph-and-how-to-relabel-edges-of-a-bipartite-graph-in-sage/?comment=43325#post-id-43325