Making bipartite graphs DM-irreducible (Q4604647)
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 6846890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making bipartite graphs DM-irreducible |
scientific article; zbMATH DE number 6846890 |
Statements
Making Bipartite Graphs DM-Irreducible (English)
0 references
5 March 2018
0 references
DM-decomposition
0 references
connectivity augmentation
0 references
bipartite graphs
0 references
matroid intersection
0 references
0 references
0.737651526927948
0 references
0.730900764465332
0 references
0.7233901023864746
0 references
0.7222422361373901
0 references
0.7141826748847961
0 references
