Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Integer Programming and Combinatorial Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: LATIN 2004: Theoretical Informatics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4370201 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4474103 / rank | |||
Normal rank | |||
Latest revision as of 12:46, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms |
scientific article |
Statements
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (English)
0 references
7 February 2007
0 references
blockers
0 references
generation algorithms
0 references
matchable graphs
0 references
0 references
