Invulnerability of planar two-tree networks

DOI10.1016/J.TCS.2018.09.021zbMATH Open1417.68165OpenAlexW2893205929MaRDI QIDQ1733045FDOQ1733045

Guanrong Chen, Yaping Mao, Haixing Zhao, Yuzhi Xiao

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

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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algorithms for reliability analysis of planar networks - a survey
• Reliability Computations for Planar Networks
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Enumeration of subtrees of planar two-tree networks
• A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
• Nonexistence of uniformly most reliable two-terminal graphs

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)