An improved Boolean circuit for maximum matching in a convex bipartite graph (Q5506330)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5499323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved Boolean circuit for maximum matching in a convex bipartite graph |
scientific article; zbMATH DE number 5499323 |
Statements
28 January 2009
0 references
0.8232134580612183
0 references
0.8036584854125977
0 references
0.7974739670753479
0 references
0.7953784465789795
0 references
0.7837498784065247
0 references
