Skip header Section
Skip Bibliometrics Section
The Combinatorics of Network ReliabilityJanuary 1987
- Author:
- Charles J. Colbourn
Abstract
No abstract available.
Cited By
- Kahl N and Luttrell K (2023). On maximum graphs in Tutte polynomial posets, Discrete Applied Mathematics, 339:C, (78-88), Online publication date: 15-Nov-2023.
- Chappidi E and Singh A (2023). A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem, Applied Intelligence, 53:22, (27269-27289), Online publication date: 1-Nov-2023.
- Brown J (2022). Maximal intervals of decrease and inflection points for node reliability, Discrete Applied Mathematics, 313:C, (40-44), Online publication date: 31-May-2022.
- Safaei F, Akbar R and Moudi M (2022). Efficient methods for computing the reliability polynomials of graphs and complex networks, The Journal of Supercomputing, 78:7, (9741-9781), Online publication date: 1-May-2022.
- Liu M, Qi X and Pan H (2022). Construction of network topology and geographical vulnerability for telecommunication network, Computer Networks: The International Journal of Computer and Telecommunications Networking, 205:C, Online publication date: 14-Mar-2022.
- Kahl N (2022). Extremal graphs for the Tutte polynomial, Journal of Combinatorial Theory Series B, 152:C, (121-152), Online publication date: 1-Jan-2022.
- Shakhov V and Migov D An Effective Method for Ensuring the Reliability of a Critical Infrastructure Monitoring Network Computational Science and Its Applications – ICCSA 2021, (526-535)
- Llagostera P, López N and Comas C (2021). Network reliability in hamiltonian graphs, Discrete Optimization, 41:C, Online publication date: 1-Aug-2021.
- Gupta A, Lee E and Li J The connectivity threshold for dense graphs Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (89-105)
- Wang T, Shao F and Zhu K (2021). Structural health analysis on cyber physical system based on reliability, The Journal of Supercomputing, 77:1, (445-470), Online publication date: 1-Jan-2021.
- Mochalov V and Mochalova A Application of Expert Systems and Simulation Modeling to Calculate Connectivity Between the Nodes of the Graph Advances in Soft Computing, (470-480)
Peng P and Yoshida Y Average Sensitivity of Spectral Clustering Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1132-1140)- Lagos G and Romero P On the Reliability of Dynamical Stochastic Binary Systems Machine Learning, Optimization, and Data Science, (516-527)
- Chen S and Lin Y (2020). A permutation-and-backtrack approach for reliability evaluation in multistate information networks, Applied Mathematics and Computation, 373:C, Online publication date: 15-May-2020.
- Li H, Patterson S, Yi Y and Zhang Z (2020). Maximizing the Number of Spanning Trees in a Connected Graph, IEEE Transactions on Information Theory, 66:2, (1248-1260), Online publication date: 1-Feb-2020.
- Altherwy Y, Elmallah E and McCann J Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm Proceedings of the 17th Conference on Embedded Networked Sensor Systems, (444-445)
- Rela G, Robledo F and Romero P Uniformly Most-Reliable Graphs and Antiholes Machine Learning, Optimization, and Data Science, (434-444)
- Azad N and Hassini E (2019). A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand Losses, Transportation Science, 53:5, (1287-1312), Online publication date: 1-Sep-2019.
- Brown J and DeGagné C (2019). On the reliability roots of simplicial complexes and matroids, Discrete Mathematics, 342:8, (2356-2370), Online publication date: 1-Aug-2019.
- Hao Z, Yeh W, Wang J, Wang G and Sun B (2019). A Quick Inclusion-Exclusion technique, Information Sciences: an International Journal, 486:C, (20-30), Online publication date: 1-Jun-2019.
- Elbassioni K, Rauf I and Ray S (2019). A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs, Theoretical Computer Science, 767:C, (26-33), Online publication date: 3-May-2019.
- (2019). AltaRica 3.0 in ten modelling patterns, International Journal of Critical Computer-Based Systems, 9:1-2, (133-165), Online publication date: 1-Jan-2019.
- He L, Cao Q, Shang F and Sarder M (2019). Measuring Component Importance for Network System Using Cellular Automata, Complexity, 2019, Online publication date: 1-Jan-2019.
- Brown J and Cox D (2018). Optimal Graphs for Independence and k-Independence Polynomials, Graphs and Combinatorics, 34:6, (1445-1457), Online publication date: 1-Nov-2018.
- Banfi J, Basilico N and Amigoni F (2018). Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms, IEEE Transactions on Robotics, 34:5, (1299-1314), Online publication date: 1-Oct-2018.
- Petelin O and Betz V (2018). Wotan, ACM Transactions on Reconfigurable Technology and Systems, 11:2, (1-23), Online publication date: 30-Jun-2018.
- Bezawada B, Kulkarni S, Ray I, Ray I and Li R Independent Key Distribution Protocols for Broadcast Authentication Proceedings of the 23nd ACM on Symposium on Access Control Models and Technologies, (27-38)
- Wu C, Wang Y, Lu Z, Pardalos P, Xu D, Zhang Z and Du D (2018). Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming, Mathematical Programming: Series A and B, 169:1, (255-275), Online publication date: 1-May-2018.
- Jin W, Yu P, Xiong A, Zhang Q, Jin D, Zhang G and Wang Y An approximate all-terminal reliability evaluation method for large-scale smart grid communication systems NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium, (1-5)
- Hu J, Wu X, Cheng R, Luo S and Fang Y (2017). On Minimal Steiner Maximum-Connected Subgraph Queries, IEEE Transactions on Knowledge and Data Engineering, 29:11, (2455-2469), Online publication date: 1-Nov-2017.
- Sun H, Cai X and Chen H (2017). Study on Parameter Evaluation System of Communication Network, Procedia Computer Science, 107:C, (584-589), Online publication date: 1-Apr-2017.
- Gatterbauer W and Suciu D (2017). Dissociation and propagation for approximate lifted inference with standard relational database management systems, The VLDB Journal — The International Journal on Very Large Data Bases, 26:1, (5-30), Online publication date: 1-Feb-2017.
- Kahl N (2016). On constructing rational spanning tree edge densities, Discrete Applied Mathematics, 213:C, (224-232), Online publication date: 20-Nov-2016.
- Bergner M, LÜbbecke M and Witt J (2016). A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs, ACM Journal of Experimental Algorithmics, 21, (1-16), Online publication date: 4-Nov-2016.
- Hu J, Wu X, Cheng R, Luo S and Fang Y Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, (1241-1250)
- Brown J and Mol L (2016). On the roots of the node reliability polynomial, Networks, 68:3, (238-246), Online publication date: 1-Oct-2016.
- Brown J and Cox D (2016). Inflection points of reliability polynomials are dense in [0,1], Networks, 67:4, (266-269), Online publication date: 1-Jul-2016.
- Botev Z, L'Ecuyer P, Simard R and Tuffin B (2016). Static Network Reliability Estimation under the Marshall-Olkin Copula, ACM Transactions on Modeling and Computer Simulation, 26:2, (1-28), Online publication date: 28-Jan-2016.
- Burgos J and Amoza F (2016). Factorization of network reliability with perfect nodes I, Discrete Applied Mathematics, 198:C, (82-90), Online publication date: 10-Jan-2016.
- Burgos J (2016). Factorization of network reliability with perfect nodes II, Discrete Applied Mathematics, 198:C, (91-100), Online publication date: 10-Jan-2016.
- Jiang M, Xia G and Zhang Y Edge-Disjoint Packing of Stars and Cycles Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (676-687)
- Silva J, Gomes T, Tipper D, Martins L and Kounev V (2015). An effective algorithm for computing all-terminal reliability bounds, Networks, 66:4, (282-295), Online publication date: 1-Dec-2015.
- Vahabi H, Koutsopoulos I, Gullo F and Halkidi M DifRec Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, (1481-1490)
- Tian Y and Meng J (2015). Restricted Connectivity for Some Interconnection Networks, Graphs and Combinatorics, 31:5, (1727-1737), Online publication date: 1-Sep-2015.
- Büke B, Smith J and Thomas S (2015). On a Random Walk Survivability problem with arc failures and memory, Networks, 66:1, (67-86), Online publication date: 1-Aug-2015.
- Dinh T and Thai M (2015). Network under joint node and link attacks, IEEE/ACM Transactions on Networking, 23:3, (1001-1011), Online publication date: 1-Jun-2015.
- Khapugin S and Rodionov A Modeling grouped failures in network reliability analysis Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, (1-5)
- Shakhov V, Migov D and Rodionov A Operation strategy for energy harvesting wireless sensor networks Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, (1-5)
- Nechunaeva K and Migov D Speeding up of genetic algorithm for network topology optimization with use of cumulative updating of network reliability Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, (1-4)
- Botev Z, Vaisman S, Rubinstein R and L'Ecuyer P Reliability of stochastic flow networks with continuous link capacities Proceedings of the 2014 Winter Simulation Conference, (543-552)
- Shah R, Hirsch C, Kroese D and Schmidt V Rare event probability estimation for connectivity of large random graphs Proceedings of the 2014 Winter Simulation Conference, (510-521)
- Yuan Y, Wang G and Chen L Pattern Match Query in a Large Uncertain Graph Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, (519-528)
- Graves C and Milan D (2014). Reliability polynomials having arbitrarily many inflection points, Networks, 64:1, (1-5), Online publication date: 1-Aug-2014.
- Lam H and Szeto K Search for the most reliable network of fixed connectivity using genetic algorithm Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, (117-118)
- Migov D and Rodionov A Parallel Implementation of the Factoring Method for Network Reliability Calculation Proceedings of the 14th International Conference on Computational Science and Its Applications — ICCSA 2014 - Volume 8584, (654-664)
- Bergner M, Lübbecke M and Witt J A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504, (34-45)
- Brown J, Koç Y and Kooij R (2014). Inflection points for network reliability, Telecommunications Systems, 56:1, (79-84), Online publication date: 1-May-2014.
- Khanna S and Lucier B Influence maximization in undirected networks Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (1482-1496)
- Das J and Wilton S (2013). Towards development of an analytical model relating FPGA architecture parameters to routability, ACM Transactions on Reconfigurable Technology and Systems, 6:2, (1-24), Online publication date: 1-Jul-2013.
- Cancela H, Robledo F, Rubino G and Sartor P (2013). Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets, Computer Communications, 36:6, (611-620), Online publication date: 1-Mar-2013.
- Migov D and Rodionov A Decomposing graph with 2-node cuts for diameter constrained network reliability calculation Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, (1-6)
- Botev Z, L'Ecuyer P, Rubino G, Simard R and Tuffin B (2013). Static Network Reliability Estimation via Generalized Splitting, INFORMS Journal on Computing, 25:1, (56-71), Online publication date: 1-Jan-2013.
- Niesink P, Poulin K and ŠAjna M (2013). Computing transitive closure of bipolar weighted digraphs, Discrete Applied Mathematics, 161:1-2, (217-243), Online publication date: 1-Jan-2013.
- Botev Z, L'Ecuyer P and Tuffin B Dependent failures in highly reliable static networks Proceedings of the Winter Simulation Conference, (1-12)
- Munch E, Shapiro M and Harer J (2012). Failure filtrations for fenced sensor networks, International Journal of Robotics Research, 31:9, (1044-1056), Online publication date: 1-Aug-2012.
- Shen Y, Syu Y, Nguyen D and Thai M Maximizing circle of trust in online social networks Proceedings of the 23rd ACM conference on Hypertext and social media, (155-164)
- Zhou R, Liu C, Yu J, Liang W, Chen B and Li J Finding maximal k-edge-connected subgraphs from a large graph Proceedings of the 15th International Conference on Extending Database Technology, (480-491)
- Migov D and Rodionova O Calculating two-terminal reliability in a diameter constrained network with cutnodes Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, (1-6)
- Anagnostopoulos A, Kumar R, Mahdian M, Upfal E and Vandin F Algorithms on evolving graphs Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (149-160)
- Eronen L, Hintsanen P and Toivonen H Biomine Bisociative Knowledge Discovery, (364-378)
- Langohr L and Toivonen H Finding representative nodes in probabilistic graphs Bisociative Knowledge Discovery, (218-229)
- Kuipers F (2012). An overview of algorithms for network survivability, ISRN Communications and Networking, 2012, (24-24), Online publication date: 1-Jan-2012.
- L'Ecuyer P, Saggadi S and Tuffin B Graph reductions to speed up importance sampling-based static reliability estimation Proceedings of the Winter Simulation Conference, (429-438)
- Jin R, Liu L and Aggarwal C Discovering highly reliable subgraphs in uncertain graphs Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, (992-1000)
- Lin Y and Yeh C (2011). Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget, Computers and Operations Research, 38:8, (1175-1187), Online publication date: 1-Aug-2011.
- Migov D (2011). Computing diameter constrained reliability of a network with junction points, Automation and Remote Control, 72:7, (1415-1419), Online publication date: 1-Jul-2011.
- Jin R, Liu L, Ding B and Wang H (2011). Distance-constraint reachability computation in uncertain graphs, Proceedings of the VLDB Endowment, 4:9, (551-562), Online publication date: 1-Jun-2011.
- Lonc Z and Truszczyński M (2011). On graph equivalences preserved under extensions, Discrete Mathematics, 311:12, (966-977), Online publication date: 1-Jun-2011.
- Herrmann J and Soh S Comparison of binary and multi-variate hybrid decision diagram algorithms for k-terminal reliability Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113, (153-162)
- Ding W and Xue G A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II, (268-280)
- Cancela H, Rubino G, L'Ecuyer P and Tuffin B Combination of conditional Monte Carlo and approximate zero-variance importance sampling for network reliability estimation Proceedings of the Winter Simulation Conference, (1263-1274)
- Karenos K, Pendarakis D, Kalogeraki V, Yang H and Liu Z Overlay routing under geographically correlated failures in distributed event-based systems Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II, (764-784)
- Foley S, Adams W and O'Sullivan B Aggregating trust using triangular norms in the keynote trust management system Proceedings of the 6th international conference on Security and trust management, (100-115)
- Kasari M, Toivonen H and Hintsanen P Fast discovery of reliable k-terminal subgraphs Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II, (168-177)
- Cheng P and Masuyama S (2010). A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ⌈(3-22)n2+n-7-2222⌉ edges, Discrete Applied Mathematics, 158:6, (608-619), Online publication date: 1-Mar-2010.
- Yeh W (2009). A simple universal generating function method to search for all minimal paths in networks, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 39:6, (1247-1254), Online publication date: 1-Nov-2009.
- Egeland G and Engelstad P (2009). The availability and reliability of wireless multi-hop networks with stochastic link failures, IEEE Journal on Selected Areas in Communications, 27:7, (1132-1146), Online publication date: 1-Sep-2009.
- Brown J and Cox D (2009). The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane, Discrete Mathematics, 309:16, (5043-5047), Online publication date: 1-Aug-2009.
- Nikolopoulos S, Palios L and Papadopoulos C (2009). Maximizing the number of spanning trees in Kn -complements of asteroidal graphs, Discrete Mathematics, 309:10, (3049-3060), Online publication date: 1-May-2009.
- Egeland G and Engelstad P The economy of redundancy in wireless multi-hop networks Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference, (3023-3028)
- Nutov Z (2009). Listing minimal edge-covers of intersecting families with applications to connectivity problems, Discrete Applied Mathematics, 157:1, (112-117), Online publication date: 1-Jan-2009.
- Mutawa A, Alazemi H and Rayes A (2009). A novel steady-state genetic algorithm approach to the reliability optimization design problem of computer networks, International Journal of Network Management, 19:1, (39-55), Online publication date: 1-Jan-2009.
- Boros E, Borys K, Gurvich V and Rudolf G (2008). Generating 3-vertex connected spanning subgraphs, Discrete Mathematics, 308:24, (6285-6297), Online publication date: 1-Dec-2008.
- Elmallah E, Gouda M and Kulkarni S (2008). Logarithmic keying, ACM Transactions on Autonomous and Adaptive Systems, 3:4, (1-18), Online publication date: 1-Nov-2008.
- Elbassioni K (2008). On the complexity of monotone dualization and generating minimal hypergraph transversals, Discrete Applied Mathematics, 156:11, (2109-2123), Online publication date: 1-Jun-2008.
- Khachiyan L, Boros E, Elbassioni K and Gurvich V (2008). Generating all minimal integral solutions to AND-OR systems of monotone inequalities, Discrete Applied Mathematics, 156:11, (2020-2034), Online publication date: 1-Jun-2008.
- Petingi L Combinatorial and computational properties of a diameter constrained network reliability model Proceedings of the WSEAS International Conference on Applied Computing Conference, (337-345)
- Eisenstat D, Feder J, Francos G, Gordon G and Redlich A (2008). Expected rank and randomness in rooted graphs, Discrete Applied Mathematics, 156:5, (746-756), Online publication date: 1-Mar-2008.
- Manfredi V Robust routing in networks with time-varying links Proceedings of the 2007 ACM CoNEXT conference, (1-2)
- Konak A Combining network reductions and simulation to estimate network reliability Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come, (2301-2305)
- Boros E, Borys K, Elbassioni K, Gurvich V, Makino K and Rudolf G Generating minimal k-vertex connected spanning subgraphs Proceedings of the 13th annual international conference on Computing and Combinatorics, (222-231)
- Ghosh J, Ngo H, Seokhoon Yoon and Chunming Qiao On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (1721-1729)
- Meng-Lai Yin and Arellano R The Importance of Maintenance Planning - A Case Study Proceedings of the 2007 Annual Reliability and Maintainability Symposium, (482-487)
- Shrestha A, Liudong Xing and Hong Liu Modeling and Evaluating the Reliability of Wireless Sensor Networks Proceedings of the 2007 Annual Reliability and Maintainability Symposium, (186-191)
- Gouda M, Kulkarni S and Elmallah E Logarithmic keying of communication networks Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems, (314-323)
- Rothschild B and Shahriari S (2006). Cutsets and anti-chains in linear lattices, Journal of Combinatorial Theory Series A, 113:8, (1783-1790), Online publication date: 1-Nov-2006.
- Khachiyan L, Boros E, Elbassioni K and Gurvich V (2006). An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation, Discrete Applied Mathematics, 154:16, (2350-2372), Online publication date: 1-Nov-2006.
- Kohlas R, Jonczy J and Haenni R Towards a precise semantics for authenticity and trust Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services, (1-9)
- Sevon P, Eronen L, Hintsanen P, Kulovesi K and Toivonen H Link discovery in graphs derived from biological databases Proceedings of the Third international conference on Data Integration in the Life Sciences, (35-49)
- Zhang Z and Meng J (2006). On optimally-λ(3) transitive graphs, Discrete Applied Mathematics, 154:6, (1011-1018), Online publication date: 15-Apr-2006.
- Zhang Z and Meng J (2006). On optimally-λ(3) transitive graphs, Discrete Applied Mathematics, 154:6, (1011-1018), Online publication date: 15-Apr-2006.
- Judson D, Bagchi S and Quint T (2005). On the inference of semi-coherent structures from data, Computers and Operations Research, 32:11, (2853-2874), Online publication date: 1-Nov-2005.
- Khachiyan L, Boros E, Elbassioni K and Gurvich V A New Algorithm for the Hypergraph Transversal Problem Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (767-776)
- Nariai S, Hui K and Kroese D Designing an optimal network using the cross-entropy method Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning, (228-233)
- Golin M, Leung Y and Wang Y Counting spanning trees and other structures in non-constant-jump circulant graphs Proceedings of the 15th international conference on Algorithms and Computation, (508-521)
- Konak A, Smith A and Kulturel-Konak S New event-driven sampling techniques for network reliability estimation Proceedings of the 36th conference on Winter simulation, (224-231)
- Nikolopoulos S, Nomikos C and Rondogiannis P (2004). A limit characterization for the number of spanning trees of graphs, Information Processing Letters, 90:6, (307-313), Online publication date: 30-Jun-2004.
- Golin M and Leung Y Unhooking circulant graphs Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science, (296-307)
- Das O and Woodside C (2004). Analyzing the effectiveness of fault-management architectures in layered distributed systems, Performance Evaluation, 56:1-4, (93-120), Online publication date: 1-Mar-2004.
- Das O and Woodside C Computing the performability of layered distributed systems with a management architecture Proceedings of the 4th international workshop on Software and performance, (174-185)
- Das O and Woodside C (2004). Computing the performability of layered distributed systems with a management architecture, ACM SIGSOFT Software Engineering Notes, 29:1, (174-185), Online publication date: 1-Jan-2004.
- Izadi B and özgüner F (2004). An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability, The Journal of Supercomputing, 27:1, (5-17), Online publication date: 1-Jan-2004.
- Campbell S, Kumar M and Olariu S (2004). The hierarchical cliques interconnection network, Journal of Parallel and Distributed Computing, 64:1, (16-28), Online publication date: 1-Jan-2004.
- Altiparmak F, Dengiz B and Smith A (2003). Optimal Design of Reliable Computer Networks, Journal of Heuristics, 9:6, (471-487), Online publication date: 1-Dec-2003.
- Makino K, Ono H and Ibaraki T (2003). Interior and exterior functions of positive Boolean functions, Discrete Applied Mathematics, 130:3, (417-436), Online publication date: 23-Aug-2003.
- Bailey A, Gordon G, Patton M and Scancella J (2003). Expected value expansions in rooted graphs, Discrete Applied Mathematics, 128:2-3, (555-571), Online publication date: 1-Jun-2003.
- Papadimitratos P, Haas Z and Sirer E Path set selection in mobile ad hoc networks Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, (1-11)
- Ath Y, Ebneshahrashoob M, Gao T and Sobel M (2002). Accessibility and Reliability for Connected Bipartite Graphs, Methodology and Computing in Applied Probability, 4:2, (153-161), Online publication date: 1-Jun-2002.
- Chernyak A (1999). Reliability covering problems for hypergraphs, Cybernetics and Systems Analysis, 35:1, (100-111), Online publication date: 1-Jan-1999.
- Kyandoghere K (1998). Survivability performance analysis of rerouting strategies in an ATM/VP DCS survivable mesh network, ACM SIGCOMM Computer Communication Review, 28:5, (22-49), Online publication date: 1-Oct-1998.
- McKay B, Myrvold W and Nadon J Fast backtracking principles applied to find new cages Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (188-191)
- Karger D and Tai R Implementing a fully polynomial time approximation scheme for all terminal network reliability Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (334-343)
- (1996). The Delta-Wye Approximation Procedure for Two-Terminal Reliability, Operations Research, 44:5, (745-757), Online publication date: 1-Oct-1996.
- Varvarigos E and Banerjee A (1996). Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies, IEEE Transactions on Parallel and Distributed Systems, 7:8, (886-895), Online publication date: 1-Aug-1996.
- Izadi B and Özgüner F Optimal Subcube Fault Tolerance in a Circuit-Switched Hypercube Proceedings of the 10th International Parallel Processing Symposium, (655-659)
- Cancela H and Khadiri M A Simulation Algorithm for Source Terminal Communication Network Reliability Proceedings of the 29th Annual Simulation Symposium (SS '96)
- Öhring S and Das S (1996). Folded Petersen Cube Networks, IEEE Transactions on Parallel and Distributed Systems, 7:2, (151-168), Online publication date: 1-Feb-1996.
- Wilson D and Propp J How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (448-457)
- Karger D A randomized fully polynomial time approximation scheme for the all terminal network reliability problem Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (11-17)
- de Rougemont M The reliability of queries (extended abstract) Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (286-291)
- Greenberg A and Srikant R Computational techniques for accurate performance evaluation of multirate, multihop communication networks Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, (253-260)
- Greenberg A and Srikant R (1995). Computational techniques for accurate performance evaluation of multirate, multihop communication networks, ACM SIGMETRICS Performance Evaluation Review, 23:1, (253-260), Online publication date: 1-May-1995.
- Stephens A, Yesha Y and Humenik K (1994). Optimal Allocation for Partially Replicated Database Systems on Ring Networks, IEEE Transactions on Knowledge and Data Engineering, 6:6, (975-982), Online publication date: 1-Dec-1994.
- Balakrishnan M and Reibman A (1994). Reliability Models for Fault-Tolerant Private Network Applications, IEEE Transactions on Computers, 43:9, (1039-1053), Online publication date: 1-Sep-1994.
- Karger D and Motwani R Derandomization through approximation Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (497-506)
- Karger D Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (21-30)
- Colbourn C (1992). A note on boundingk-terminal reliability, Algorithmica, 7:1-6, (303-307), Online publication date: 1-Jun-1992.
- Johnson D and Raab L A tight upper bound on the benefits of replication and consistency control protocols Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (75-81)
- Soh S and Rai S (1991). CAREL, IEEE Transactions on Parallel and Distributed Systems, 2:2, (199-213), Online publication date: 1-Apr-1991.
- Colbourn C (1988). Edge-packing of graphs and network reliability, Discrete Mathematics, 72:1, (49-61), Online publication date: 1-Dec-1988.
Recommendations
On the combinatorics of derangements and related permutations
Highlights- Provide a bijection combinatorial proof for the facts that The number of derangements of length n equals the number of permutations of length n that have ...
AbstractA derangement is a permutation in which no entry is at its original position. The number of derangements of [ n ] is called the “derangement number” or “de Montmort number”, and is denoted by D n. The sequence { D n } enumerates, in ...
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Special Issue on StringologySuppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ$^+$ has a unique maximal factorization over W. The classic circ-UMFF is the set of ...
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Special Issue on StringologySuppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ$^+$ has a unique maximal factorization over W. The classic circ-UMFF is the set of ...