The maximal flow through a directed graph with random capacities (Q3660649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/17442508208833234 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051111718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow in networks with random capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: General first-passage percolation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:27, 14 June 2024

scientific article
Language Label Description Also known as
English
The maximal flow through a directed graph with random capacities
scientific article

    Statements

    The maximal flow through a directed graph with random capacities (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    network flow
    0 references
    random capacities
    0 references
    random graph
    0 references
    percolation
    0 references

    Identifiers