Связность и отказоустойчивость в случайных регулярных графах: различия между версиями
Перейти к навигации
Перейти к поиску
Irina (обсуждение | вклад) |
Irina (обсуждение | вклад) |
||
| Строка 122: | Строка 122: | ||
== Литература == | == Литература == | ||
1. Alon, N., Spencer, J.: The Probabilistic Method. Wiley (1992) | 1. Alon, N., Spencer, J.: The Probabilistic Method. Wiley (1992) | ||
2. Bollobas, B.: Random Graphs. Academic Press (1985) | 2. Bollobas, B.: Random Graphs. Academic Press (1985) | ||
3. Bollobas, B.: A probabilistic proof of an asymptotic formula for the number of labeled regular graphs. Eur. J. Comb. 1,311-316 (1980) | 3. Bollobas, B.: A probabilistic proof of an asymptotic formula for the number of labeled regular graphs. Eur. J. Comb. 1,311-316 (1980) | ||
4. Goerdt, A.: The giant component threshold for random regular graphs with edge faults. In: Proceedings of Mathematical Foundations of Computer Science '97 (MFCS'97), pp. 279-288. (1997) | 4. Goerdt, A.: The giant component threshold for random regular graphs with edge faults. In: Proceedings of Mathematical Foundations of Computer Science '97 (MFCS'97), pp. 279-288. (1997) | ||
5. Goerdt, A.: Random regular graphs with edge faults: Expansion through cores. Theor. Comput. Sci. 264(1), 91-125 (2001) | 5. Goerdt, A.: Random regular graphs with edge faults: Expansion through cores. Theor. Comput. Sci. 264(1), 91-125 (2001) | ||
6. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995) | 6. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995) | ||
7. Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Connectivity Properties in Random Regular Graphs with Edge Faults. In: Special Issue on Randomized Computing of the International Journal of Foundations of Computer Science (IJFCS), vol. 11 no. 2, pp. 247-262, World Scientific Publishing Company (2000) | 7. Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Connectivity Properties in Random Regular Graphs with Edge Faults. In: Special Issue on Randomized Computing of the International Journal of Foundations of Computer Science (IJFCS), vol. 11 no. 2, pp. 247-262, World Scientific Publishing Company (2000) | ||
8. Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. In: Proc. 21st International Colloquium on Automata, Languages and Programming (ICALP), pp. 508-515. Jerusalem (1994) | 8. Nikoletseas, S., Palem, K., Spirakis, P., Yung, M.: Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. In: Proc. 21st International Colloquium on Automata, Languages and Programming (ICALP), pp. 508-515. Jerusalem (1994) | ||
9. Nikoletseas, S., Pantziou, G., Psycharis, P., Spirakis, P.: On the reliability of fat-trees. In: Proc. 3rd International European Conference on Parallel Processing (Euro-Par), pp. 208-217, Passau, Germany (1997) | 9. Nikoletseas, S., Pantziou, G., Psycharis, P., Spirakis, P.: On the reliability of fat-trees. In: Proc. 3rd International European Conference on Parallel Processing (Euro-Par), pp. 208-217, Passau, Germany (1997) | ||
10. Nikoletseas, S., Spirakis, P.: Expander Properties in Random Regular Graphs with Edge Faults. In: Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.421 -432, MCinchen (1995) | 10. Nikoletseas, S., Spirakis, P.: Expander Properties in Random Regular Graphs with Edge Faults. In: Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.421 -432, MCinchen (1995) | ||