
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.G. Prohazka, "Bounding the Maximum Size of a Packet Radio Network," IEEE Transactions on Computers, vol. 37, no. 10, pp. 11841190, October, 1988.  
BibTex  x  
@article{ 10.1109/12.5980, author = {C.G. Prohazka}, title = {Bounding the Maximum Size of a Packet Radio Network}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {10}, issn = {00189340}, year = {1988}, pages = {11841190}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.5980}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Bounding the Maximum Size of a Packet Radio Network IS  10 SN  00189340 SP1184 EP1190 EPD  11841190 A1  C.G. Prohazka, PY  1988 KW  maximum size bounding; packet radio network; topology design; timedivision multiplexing; fedge colorable directed graph; graph colouring; packet switching; radio networks. VL  37 JA  IEEE Transactions on Computers ER   
[1] C. Prohazka, "The design of timescheduled packet radio networks," Ph.D. dissertation, Univ. of Massachusetts, Amherst, MA, 1981.
[2] M. Garey and D. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[3] Y. Gold, W. Franta, and S. Moran, "A distributed channelaccess protocol for fullyconnected networks with mobile nodes,"IEEE Trans. Comput., vol. C32, pp. 133147, 1983.
[4] R. Sinha and S. Gupta, "Mobile packet radio networks: Stateoftheart,"IEEE Communications, vol. 23, no. 3, pp. 5361, 1985.
[5] E. Arikan, "Some complexity results about packet radio networks,"IEEE Trans. Inform. Theory, vol. IT30, pp. 681685, 1984.
[6] S. Fiorini and R. Wilson,EdgeColourings of Graphs. Marshfield, MA: Pitman, 1979.
[7] I. Holyer, "The NPcompleteness of edgecoloring,"SIAM J. Comput., vol. 10, no. 4, pp. 718720, 1981.
[8] I. Holyer, "The NPcompleteness of some edgepartition problems,"SIAM J. Comput., vol. 10, no. 4, pp. 713717, 1981.
[9] K. Noshita, "On proving the complexity of a certain graphcoloring problem,"J. Inform. Processing, vol. 7, pp. 106110, 1984.
[10] R. Irving, "NPcompleteness of a family of graphcoloring problems,"Discrete Appl. Math., vol. 5, pp. 111117, 1983.
[11] M. Kubale, "A generalized implicit enumeration algorithm for graph coloring,"Commun. ACM, vol. 28, no. 4, pp. 412418, 1985.
[12] D. Brelaz, "New methods to color the vertices of a graph,"Commun. ACM, vol. 22, no. 4, pp. 251256, 1979.
[13] J. Peemöller, "A correction to Brelaz's modification of Brown's coloring algorithm,"Commun. ACM, vol. 26, no. 8, pp. 595597, 1983.
[14] E. Arjomandi, "An efficient algorithm for colouring the edges of a graph withΔ+ 1 colours,"INFOR Canad. J. Oper. Res. Inform. Processing, vol. 20, no. 23, pp. 82101, 1982.
[15] O. Terada and T. Nishizeki, "Approximate algorithms for the edge coloring of graphs,"Trans. IECE Japan, section E, vol. E65, no. 11, p. 704, 1982.
[16] U. Manber and M. Tompa, "The effect of number of Hamiltonian paths on the complexity of a vertexcoloring problem,"SIAM J. Comput., vol. 13, no. 1, pp. 109115, 1984.
[17] A. Proskurowski and M. Syslo, "Efficient vertex and edgecoloring of outerplanar graphs,"SIAM J. Algebraic Discrete Meth., vol. 7, p. 131, 1986.
[18] L. Eggan and M. Plantholt, "The chromatic index of nearly bipartite multigraphs,"J. Combinatorial Theory, series B, vol. 40, p. 71, 1986.
[19] H. Krawczyk and M. Kubale, "An approximation algorithm for diagnostic test scheduling in multicomputer systems,"IEEE Trans. Comput., vol. 34, p. 869, 1985.
[20] R. Tarjan, "Decomposition by clique separators,"Discrete Math., vol. 55, p. 221, 1985.
[21] I. Holyer and E. Cockayne, "On the sum of cardinalities of extremum maximal independent sets,"Discrete Math., vol. 26, p. 243, 1979.
[22] M. Plantholt, "The chromatic index of graphs with large maximum degree,"Discrete Math., vol. 47, p. 91, 1983.
[23] R. Dutton, "A new graph coloring algorithm,"Comput. J. (GB), vol. 24, no. 1, pp. 8586, 1981.
[24] A. Brouwer, "On the edgecoloring problem for unions of complete uniform hypergraphs,"Discrete Math., vol. 34, no. 3, pp. 241260, 1981.
[25] S. Poljak and V. Rodl, "On the arcchromatic number of a digraph,"J. Combinatorial Theory, series B, vol. 31, no. 2, pp. 190198, 1981.
[26] M. Goldberg, "Construction of class 2 graphs with maximum vertex degree 3,"J. Combinatorial Theory, series B, vol. 31, no. 3, pp. 282291, 1981.
[27] D. de Werra, "On the existence of generalized good and equitable edge colorings,"J. Graph Theory, vol. 5, no. 3, pp. 247258, 1981.
[28] D. Geller and A. Hilton, "How to color the lines of a bigraph,"Networks, vol. 4, pp. 281282, 1974.
[29] D. Greenwell and H. Kronk, "Uniquely linecolorable graphs,"Canad. Math. Bull., vol. 16, pp. 525529, 1973.
[30] S. Fiorini, "On the chromatic index of a graph,"J. Combinatorial Theory, series B, vol. 18, pp. 3538, 1975.
[31] D. de Werra, "Some remarks on good colorations,"J. Combinational Theory, series B, vol. 21, pp. 5764, 1976.
[32] R. Gupta, "On decompositions of a multigraph into spanning subgraphs,"Bull. Amer. Math. Soc., vol. 80, pp. 500502, 1974.
[33] P. Cameron, "Minimal edgecolourings of complete graphs,"J. London Math. Soc. (2), vol. 11, pp. 337346, 1975.