Author:
Colbourn Charles J.,Provan J. Scott,Vertigan Dirk
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. M. O. Ball, andJ. S. Provan: Bounds on the reliability polynomial of shellable independence systems,SIAM J. Alg. Disc. Math. 3 (1982), 166–181.
2. R. A. Brualdi, andE. B. Scrimger: Exchange systems, matchings, and transversals,J. Comb. Th. 5 (1968), 224–257.
3. T. Brylawski: Constructions, inTheory of Matroids, N. White ed., Cambridge University Press, New York (1986), 127–223.
4. C. J. Colbourn, andE. S. Elmallah: Reliable assignments of processors to tasks and factoring on matroids,Discrete Math. 114 (1993), 115–129.
5. M. R. Garey, andD. S. Johnson:Computers and Intractibility: A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, CA, 1979.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献