An algorithmic framework for the matching problem in some hypergraphs (Q3789371)
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 4053385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for the matching problem in some hypergraphs |
scientific article; zbMATH DE number 4053385 |
Statements
An algorithmic framework for the matching problem in some hypergraphs (English)
0 references
1987
0 references
set packing
0 references
matching
0 references
bipartite graphs
0 references
hypergraphs
0 references
polynomial primal- dual algorithm
0 references
0.8252713084220886
0 references
0.8221782445907593
0 references
