Degree bounded matroids and submodular flows (Q2448960)
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 6292171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree bounded matroids and submodular flows |
scientific article; zbMATH DE number 6292171 |
Statements
Degree bounded matroids and submodular flows (English)
0 references
5 May 2014
0 references
The complexity of several rather restricted tasks is elaborated in interdependency of: minimum bounded degree matroid basis, minimum bounded degree submodular flow, minimum bounded degree spanning tree, minimum crossing spanning tree, minimum bounded-ones binary matroid basis, minimum bounded degree graph orientation, etc. There are many proofs in verbal form over 5 or 6 lines. In addition, one will find three long proofs in verbose form. All this is obviously relevant to those who are highly specialized in the field.
0 references
complexity
0 references
bounded degree problems
0 references
0 references
0.8257907629013062
0 references
0.7061405181884766
0 references
0.7054427266120911
0 references
0.7040107846260071
0 references
