Packing rooted directed cuts in a weighted directed graph (Q4769069): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The extremal length of a network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5684698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5595648 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti-blocking polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the width—length inequality / rank | |||
Normal rank |
Revision as of 13:40, 12 June 2024
scientific article; zbMATH DE number 3443676
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing rooted directed cuts in a weighted directed graph |
scientific article; zbMATH DE number 3443676 |
Statements
Packing rooted directed cuts in a weighted directed graph (English)
0 references
1974
0 references