Maximum directed cuts in graphs with degree constraints (Q1926032): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-011-1056-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066592985 / rank | |||
Normal rank | |||
Revision as of 22:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum directed cuts in graphs with degree constraints |
scientific article |
Statements
Maximum directed cuts in graphs with degree constraints (English)
0 references
27 December 2012
0 references
maximum directed cut
0 references
max cut problem
0 references
NP-hard problem
0 references
Hall ratio
0 references
acyclic digraph
0 references
digraphs containing no directed triangles
0 references
maximum dicut
0 references
directed cut
0 references
subcubic graph
0 references
triangle-free graph
0 references
