Heuristics for finding a maximum number of disjoint bounded paths
From MaRDI portal
Publication:3695028
DOI10.1002/net.3230140405zbMath0575.90083MaRDI QIDQ3695028
No author found.
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140405
design of communication networks; maximum number of vertex disjoint paths; polynomial heuristic algorithm
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
Related Items
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks, Paths of bounded length and their cuts: parameterized complexity and algorithms, The Menger number of the Cartesian product of graphs, Finding disjoint paths with related path costs, Large fault-tolerant interconnection networks, Heuristic methods and applications: A categorized survey, On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
Cites Work