Networks immune to isolated line failures

DOI10.1002/NET.3230120404zbMath0493.94020OpenAlexW1986824573MaRDI QIDQ3956856

Andrzej Proskurowski, Arthur M. Farley

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

algorithmrouting tables

Mathematics Subject Classification ID

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

Related Items (19)

Characterization and Recognition of Partial 3-Trees ⋮ Vertex partitioning problems on graphs with bounded tree width ⋮ Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs ⋮ Complexity of Finding Embeddings in a k-Tree ⋮ Algorithms Solving the Matching Cut Problem ⋮ Finding matching cuts in \(H\)-free graphs ⋮ Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ Algorithms solving the matching cut problem ⋮ Unnamed Item ⋮ A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs ⋮ Forbidden minors characterization of partial 3-trees ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius ⋮ Matching cut in graphs with large minimum degree ⋮ The complexity of the matching-cut problem for planar graphs and other graph classes ⋮ On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees

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