Author:
Miura Kazuyuki,Takahashi Daishiro,Nakano Shin-ichi,Nishizeki Takao
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bao, F., Igarashi, Y.: Reliable broadcasting in product networks with By-zantime faults. In: Proc. 26th Annual International Symposium on Fault-Tolelant Computing (FTCS 1996), pp. 262–271 (1996)
2. Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Technical Report CS-96-25, Department of Computer Science, Brown University (1996)
3. Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Technical Report RUU-CS-93-45, Department of Computer Science, Utrecht University (1993)
4. Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9, 507–537 (1988)
5. Dolev, D., Halpern, J.Y., Simons, B., Strong, R.: A new look at fault tolerant network routing. In: Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 526–535 (1984)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献