Funder
Polish Ministry of Science and Higher Education
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. M. Ajtai, N. Alon, J. Bruck, R. Cypher, C.T. Ho, M. Naor, E. Szemerédi, Fault tolerant graphs, perfect hash functions and disjoint paths, in: Proc. IEEE Symp. on Foundations of Computer Science, 1992, pp. 693–702.
2. Transversal numbers of uniform hypergraphs;Alon;Graphs Combin.,1990
3. Explicit construction of linear sized tolerant networks;Alon;Discrete Math.,1988
4. Minimum k-path vertex cover;Brešar;Discrete Appl. Math.,2011
5. Fault-tolerant meshes with small degree;Bruck;SIAM J. Comput.,1997
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献