Maximum directed cuts in graphs with degree constraints (Q1926032)
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 6118545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum directed cuts in graphs with degree constraints |
scientific article; zbMATH DE number 6118545 |
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
0 references
0 references
0.8462846875190735
0 references
0.8217942118644714
0 references
0.8173815011978149
0 references
0.7661738395690918
0 references
