Weighted graphs with fixed vertex degrees and network flows (Q465307): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6362924 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4275060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network models with fixed parameters at the communication nodes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network models with fixed parameters at the communication nodes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation problems with a minimax criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax under transportation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of partition of networks with fixed degrees of nodes and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Weighted graphs with fixed vertex degrees and network flows
scientific article

    Statements

    Identifiers