RO EN
Two problems concerning dynamic flows in node and arc capacitated networks
Authors: E. Ciurea
– 0.17 Mb
Abstract
This paper presents two problems concerning dynamic flow in node and arc capacitated networks: (1) maximal dynamic flow; (2) feasible dynamic flows.Eleonor Ciurea,
Department of Informatics,
The "Transilvania" University,
50, str. Iuliu Maniu, Brashov,
2200, Romania
Department of Informatics,
The "Transilvania" University,
50, str. Iuliu Maniu, Brashov,
2200, Romania
Fulltext
– 0.17 Mb
Contents
- On program correctness and teaching programming
- On graphs G of diameter two with f(G)J|V(G)|+D-d+1
- On the architecture of problem-oriented simulation systems
- SimW - software for automatic creation of problem-oriented simulation systems
- Two problems concerning dynamic flows in node and arc capacitated networks
- The study of data and control flows and the user's interface organization in an applied system for chemistry and medicine
- A method of Romanian Lexicon compression
- Design of the Sequential System Automata using Temporal Equivalence Classes
- Grammar flow analysis reduction to scheduling problem
