Invulnerability of planar two-tree networks

DOI10.1016/J.TCS.2018.09.021MaRDI QIDQ1733045zbMATH OpenOpenAlexFDO

Authors Yuzhi Xiao, Yaping Mao, Haixing Zhao, Guanrong Chen

Publication date 26 March 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.09.021

zbMATH Keywords

reliabilityplanar networkinvulnerabilityuniformly-most modeluniformly-worst model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Reliability Computations for Planar Networks
• Publication:4206399
• An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks
• A linear-time algorithm to compute the reliability of planar cube-free networks
• scientific article; zbMATH DE number 4019092

Cites work

• scientific article; zbMATH DE number 913349 (Why is no real title available?)
• scientific article; zbMATH DE number 1444280 (Why is no real title available?)
• A local approximation algorithm for minimum dominating set problem in anonymous planar networks
• A proof of Boesch's conjecture
• Algorithms and Computation
• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• Enumeration of connected spanning subgraphs of a planar graph
• Finding a maximum-density path in a tree under the weight and length constraints
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• New method for counting the number of spanning trees in a two-tree network
• On reliability of graphs with node failures
• On the existence of uniformly optimally reliable networks
• On the number of spanning trees a planar graph can have
• On the roots of all-terminal reliability polynomials
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Spanning trees on the Sierpinski gasket
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Vulnerability of complex networks
• Vulnerability of super edge-connected networks
• Weighted restrained domination in subclasses of planar graphs

Cited in

(11)

• Nonexistence of uniformly most reliable two-terminal graphs
• The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Efficient algorithms for reliability analysis of planar networks - a survey
• Reliability analysis of the cactus-based networks
• scientific article; zbMATH DE number 4019092 (Why is no real title available?)
• Reliability Computations for Planar Networks
• scientific article; zbMATH DE number 4126698 (Why is no real title available?)
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
• Connectivity of the planar graph with highly reliable edges
• Enumeration of subtrees of planar two-tree networks

This page was built for publication: Invulnerability of planar two-tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733045)