Invulnerability of planar two-tree networks
type: Item
instance of: scholarly article
title: Invulnerability of planar two-tree networks
zbMATH Open document ID: 1417.68165
author: Yuzhi Xiao
author: Yaping Mao
author: Haixing Zhao
author: Guanrong Chen
published in: Theoretical Computer Science
publication date: 2019-03-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 7041819
zbMATH Keywords: planar network
zbMATH Keywords: invulnerability
zbMATH Keywords: reliability
zbMATH Keywords: uniformly-most model
zbMATH Keywords: uniformly-worst model
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.09.021
OpenAlex ID: W2893205929
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: On unreliability polynomials and graph connectivity in reliable network synthesis
cites work: On the existence of uniformly optimally reliable networks
cites work: On the roots of all-terminal reliability polynomials
cites work: On the Number of Spanning Trees a Planar Graph Can Have
cites work: Spanning trees on the Sierpinski gasket
cites work: Label-based routing for a family of scale-free, modular, planar and unclustered graphs
cites work: Lower and upper bounds for long induced paths in 3-connected planar graphs
cites work: On reliability of graphs with node failures
cites work: Vulnerability of super edge-connected networks
cites work: Finding a maximum-density path in a tree under the weight and length constraints
cites work: Algorithms and Computation
cites work: Enumeration of connected spanning subgraphs of a planar graph
cites work: Q4953320
cites work: Vulnerability of complex networks
cites work: Q4887741
cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs
cites work: Complexity of the maximum leaf spanning tree problem on planar and regular graphs
cites work: A proof of Boesch's conjecture
cites work: A local approximation algorithm for minimum dominating set problem in anonymous planar networks
cites work: New method for counting the number of spanning trees in a two-tree network
cites work: Weighted restrained domination in subclasses of planar graphs
DOI: 10.1016/J.TCS.2018.09.021
description: scientific article; zbMATH DE number 7041819