Networks immune to isolated failures

DOI10.1002/net.3230110304zbMath0459.94036OpenAlexW1971826280MaRDI QIDQ3910454

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)

Related Items (16)

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

Cites Work

• On simple characterizations of k-trees

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