scientific article; zbMATH DE number 961960
From MaRDI portal
Publication:5689807
DOI<125::AID-NET1>3.0.CO;2-P 10.1002/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-PzbMath0865.90048MaRDI QIDQ5689807
Publication date: 6 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Distributed computation and reconfiguration in actively dynamic networks ⋮ Ranking in evolving complex networks ⋮ Edge-Disjoint Branchings in Temporal Graphs ⋮ Traveling salesman problems in temporal graphs ⋮ Mengerian temporal graphs revisited ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ On temporal graph exploration ⋮ Mengerian graphs: characterization and recognition ⋮ The complexity of growing a graph ⋮ Temporal flows in temporal networks ⋮ Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ Unnamed Item ⋮ Connectivity and inference problems for temporal networks ⋮ Finding temporal paths under waiting time constraints ⋮ Temporal network optimization subject to connectivity constraints ⋮ The Complexity of Finding Small Separators in Temporal Graphs ⋮ A model for dynamic communicators ⋮ Edge-disjoint branchings in temporal digraphs ⋮ The complexity of routing with collision avoidance ⋮ Finding Temporal Paths Under Waiting Time Constraints. ⋮ The complexity of finding small separators in temporal graphs ⋮ Unnamed Item ⋮ Feedback edge sets in temporal graphs ⋮ On the treewidth of dynamic graphs ⋮ Edge exploration of temporal graphs ⋮ The complexity of finding temporal separators under waiting time constraints ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective*
