Question

An Efficient Minimum Distance Bipartite Matching Algorithm

score 643 · Answer 1 · 2026-04-16 00:27:51

643

Views

An Efficient Minimum Distance Bipartite Matching Algorithm

Published on 16 Apr 2026 - 0:27

score 207 · Answer 2 · 2026-04-12 10:36:45

207

Views

Existence of a path consisting of only essential/inessential vertices

Published on 12 Apr 2026 - 10:36

score 64 · Answer 3 · 2026-04-12 22:21:16

64

Views

inadmissible bipartite graph

Published on 12 Apr 2026 - 22:21

score 163 · Answer 4 · 2026-04-15 15:33:24

163

Views

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

Published on 15 Apr 2026 - 15:33

score 219 · Answer 5 · 2026-04-12 12:26:33

219

Views

A problem based on Tutte's Theorem

Published on 12 Apr 2026 - 12:26

score 7.3k · Answer 6 · 2026-04-14 18:38:21

7.3k

Views

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

Published on 14 Apr 2026 - 18:38

score 193 · Answer 7 · 2026-04-10 20:04:39

193

Views

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

Published on 10 Apr 2026 - 20:04

score 172 · Answer 8 · 2026-04-09 07:27:46

172

Views

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

Published on 09 Apr 2026 - 7:27

score 568 · Answer 9 · 2026-04-11 23:13:13

568

Views

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

Published on 11 Apr 2026 - 23:13

score 117 · Answer 10 · 2026-04-15 06:07:21

117

Views

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

Published on 15 Apr 2026 - 6:07

score 191 · Answer 11 · 2026-04-12 03:07:04

191

Views

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

Published on 12 Apr 2026 - 3:07

score 67 · Answer 12 · 2026-04-15 19:53:57

67

Views

The Maximum Path of a Graph Contained In Maximum Matching

Published on 15 Apr 2026 - 19:53

score 458 · Answer 13 · 2026-04-16 01:09:03

458

Views

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

Published on 16 Apr 2026 - 1:09

score 156 · Answer 14 · 2026-04-12 00:20:40

156

Views

How many matchings does a cycle on n vertices have?

Published on 12 Apr 2026 - 0:20

score 114 · Answer 15 · 2026-04-16 10:34:57

114

Views

Parity of vertex cover for a graph with 2p vertices

Published on 16 Apr 2026 - 10:34

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