SS/TDMA Time Slot Assignment with Restricted Switching Modes
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 31 (1) , 149-154
- https://doi.org/10.1109/tcom.1983.1095734
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per InequalitySIAM Journal on Computing, 1980
- An Efficient SS/TDMA Time Slot Assignment AlgorithmIEEE Transactions on Communications, 1979
- Analysis of a switch matrix for an SS/TDMA systemProceedings of the IEEE, 1977
- Independent permutations, as related to a problem of Moser and a theorem of PólyaJournal of Combinatorial Theory, Series A, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969