Maximum directed cuts in acyclic digraphs (Q3445498): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.20215 / rank | |||
| Property / cites work | |||
| Property / cites work: Monochromatic directed walks in arc-colored directed graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.20215 / rank | |||
Normal rank | |||
Latest revision as of 07:42, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum directed cuts in acyclic digraphs |
scientific article |
Statements
Maximum directed cuts in acyclic digraphs (English)
0 references
11 June 2007
0 references
directed cut
0 references
maximum cut
0 references
directed and acyclic graphs
0 references
extremal problems
0 references
