Question

An Efficient Minimum Distance Bipartite Matching Algorithm

score 640 · Answer 1 · 2018-09-30 01:29:44

640

Views

An Efficient Minimum Distance Bipartite Matching Algorithm

Published on 30 Sep 2018 - 1:29

score 204 · Answer 2 · 2018-10-19 12:07:55

204

Views

Existence of a path consisting of only essential/inessential vertices

Published on 19 Oct 2018 - 12:07

score 60 · Answer 3 · 2018-10-24 01:36:57

60

Views

inadmissible bipartite graph

Published on 24 Oct 2018 - 1:36

score 160 · Answer 4 · 2018-10-26 05:32:25

160

Views

What is the minimum number of matchings needed to cover all the edges of a graph?

Published on 26 Oct 2018 - 5:32

score 216 · Answer 5 · 2018-10-27 17:49:45

216

Views

A problem based on Tutte's Theorem

Published on 27 Oct 2018 - 17:49

score 7.3k · Answer 6 · 2018-10-27 19:46:14

7.3k

Views

A magic trick - find out the fifth card if four is given

Published on 27 Oct 2018 - 19:46

score 190 · Answer 7 · 2018-11-13 12:30:58

190

Views

About a proof of a proposition about maximum matching (Aho, Hopcroft, Ullman)

Published on 13 Nov 2018 - 12:30

score 171 · Answer 8 · 2026-02-23 05:09:23

171

Views

Perfect matching in the n-unit-cube, Is hyperplane statement wrong?

Published on 23 Feb 2026 - 5:09

score 565 · Answer 9 · 2018-11-15 06:51:15

565

Views

Are there $|M^{*}| - |M|$ augmenting paths with respect to $M$ in $G$ which are vertex disjoint?

Published on 15 Nov 2018 - 6:51

score 114 · Answer 10 · 2018-11-23 10:24:52

114

Views

About $E_i$ in "An $n^{\frac{5}{2}}$ Algorithm for Maximum Matchings in Bipartite Graphs" by Hopcroft and Karp

Published on 23 Nov 2018 - 10:24

score 188 · Answer 11 · 2018-11-27 14:37:16

188

Views

Does there exist an algorithm that outputs a maximum weight transversal and has a stable matching?

Published on 27 Nov 2018 - 14:37

score 64 · Answer 12 · 2018-11-30 15:35:42

64

Views

The Maximum Path of a Graph Contained In Maximum Matching

Published on 30 Nov 2018 - 15:35

score 455 · Answer 13 · 2018-12-04 16:46:01

455

Views

A graph with a disjoint matching contains components that are either paths or even circuits.

Published on 04 Dec 2018 - 16:46

score 153 · Answer 14 · 2018-12-07 02:30:10

153

Views

How many matchings does a cycle on n vertices have?

Published on 07 Dec 2018 - 2:30

score 111 · Answer 15 · 2018-12-09 14:17:39

111

Views

Parity of vertex cover for a graph with 2p vertices

Published on 09 Dec 2018 - 14:17

List Question

An Efficient Minimum Distance Bipartite Matching Algorithm

Existence of a path consisting of only essential/inessential vertices

inadmissible bipartite graph

What is the minimum number of matchings needed to cover all the edges of a graph?

A problem based on Tutte's Theorem

A magic trick - find out the fifth card if four is given

About a proof of a proposition about maximum matching (Aho, Hopcroft, Ullman)

Perfect matching in the n-unit-cube, Is hyperplane statement wrong?

Are there $|M^{*}| - |M|$ augmenting paths with respect to $M$ in $G$ which are vertex disjoint?

About $E_i$ in "An $n^{\frac{5}{2}}$ Algorithm for Maximum Matchings in Bipartite Graphs" by Hopcroft and Karp

Does there exist an algorithm that outputs a maximum weight transversal and has a stable matching?

The Maximum Path of a Graph Contained In Maximum Matching

A graph with a disjoint matching contains components that are either paths or even circuits.

How many matchings does a cycle on n vertices have?

Parity of vertex cover for a graph with 2p vertices

Trending Questions

Popular # Hahtags

Popular Questions