Packing rooted directed cuts in a weighted directed graph (Q4769069): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/mp/Fulkerson74, #quickstatements; #temporary_batch_1731462974821
 
(2 intermediate revisions by 2 users not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01580218 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084278031 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/Fulkerson74 / rank
 
Normal rank

Latest revision as of 03:20, 13 November 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
    0 references
    1974
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references