Networks immune to isolated failures

DOI10.1002/NET.3230110304MaRDI QIDQ3910454zbMATH OpenOpenAlexFDO

Authors Arthur M. Farley

Publication date 1981

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230110304

zbMATH Keywords

communication networktree network

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites work

• On simple characterizations of k-trees

Cited in

(16)

• Characterization of partial 3-trees in terms of three structures
• A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
• On some optimization problems on \(k\)-trees and partial \(k\)-trees
• Reliable broadcasting
• On spanning 2-trees in a graph
• A PTAS for weight constrained Steiner trees in series--parallel graphs.
• The complexity of the locally connected spanning tree problem
• Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
• Heuristics for the network design problem with connectivity requirements
• Characterization and Recognition of Partial 3-Trees
• Complexity of Finding Embeddings in a k-Tree
• Isomorphism Testing in Hookup Classes
• On the SPANNING k-TREE problem
• Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
• Forbidden minors characterization of partial 3-trees

This page was built for publication: Networks immune to isolated failures

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