Perturbative Time and Frequency Allocations for RFID Reader Networks
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 392-402
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal Scheduling for Networks of RFID ReadersLecture Notes in Computer Science, 2005
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- A note on bipartite subgraphs of triangle‐free graphsRandom Structures & Algorithms, 1992
- How to make a graph bipartiteJournal of Combinatorial Theory, Series B, 1988
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Some Extremal Properties of Bipartite SubgraphsCanadian Journal of Mathematics, 1973
- GRAPH THEORY1969
- On some extremal problems in graph theoryIsrael Journal of Mathematics, 1965
- Graph Theory and Probability. IICanadian Journal of Mathematics, 1961
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941