Some Problems on Dynamic/Periodic Graphs
- 1 January 1984
- book chapter
- Published by Elsevier
Abstract
No abstract availableAll Related Versions
This publication has 15 references indexed in Scilit:
- Dynamic matchings and quasidynamic fractional matchings. IINetworks, 1983
- Maximum-throughput dynamic network flowsMathematical Programming, 1983
- Workforce Allocation in Cyclical Scheduling Problems: A SurveyJournal of the Operational Research Society, 1976
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- Transient flows in networks.The Michigan Mathematical Journal, 1959
- Part II ‐ Generalization and analysisNaval Research Logistics Quarterly, 1957
- An algorithm for the minimum number of transport units to maintain a fixed scheduleNaval Research Logistics Quarterly, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956