Reliable assignments of processors to tasks and factoring on matroids
DOI10.1016/0012-365X(93)90360-6zbMATH Open0796.68027OpenAlexW2139768824MaRDI QIDQ685664FDOQ685664
Authors: Charles J. Colbourn, Ehab S. Elmallah 
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90360-6
Recommendations
- Probabilistic single processor scheduling
- scientific article; zbMATH DE number 1304836
- Factoring Algorithms for Computing K-Terminal Network Reliability
- On the problem of approximating the number of bases of a matroid
- A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Matching theory
- A Survey of Network Reliability and Domination Theory
- Title not available (Why is that?)
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- The complexity of completing partial Latin squares
- Minimum partition of a matroid into independent subsets
- A Combinatorial Model for Series-Parallel Networks
- Edge-packings of graphs and network reliability
- Gammoids and transversal matroids
- A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
- Network reliability and the factoring theorem
- The NP-Completeness of Some Edge-Partition Problems
- Title not available (Why is that?)
- Counting almost minimum cutsets with reliability applications
- Title not available (Why is that?)
- On Fundamental Transversal Matroids
- Matroids and linking systems
- Matroid Steiner problems, the Tutte polynomial and network reliability
- An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Title not available (Why is that?)
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- Strict Gammoids and Rank Functions
Cited In (4)
This page was built for publication: Reliable assignments of processors to tasks and factoring on matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685664)
