Degree bounded matroids and submodular flows (Q2448960): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2109095726 / rank | |||
Normal rank |
Revision as of 21:15, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree bounded matroids and submodular flows |
scientific article |
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