The global theory of paths in networks. I: Definitions, examples and limits (Q1167670): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A solution of the Sperner-Erdős problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary condition on minimal cube numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global theory of flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639839 / rank
 
Normal rank

Latest revision as of 15:31, 13 June 2024

scientific article
Language Label Description Also known as
English
The global theory of paths in networks. I: Definitions, examples and limits
scientific article

    Statements

    The global theory of paths in networks. I: Definitions, examples and limits (English)
    0 references
    1981
    0 references
    minimum path problems
    0 references
    categorical approach
    0 references
    0 references
    0 references

    Identifiers

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