scientific article; zbMATH DE number 961960

DOI10.1002/(SICI)1097-0037(199610)28:3%3C125::AID-NET1%3E3.0.CO;2-PMaRDI QIDQ5689807zbMATH OpenFDO

Authors Kenneth A. Berman

Publication date 6 July 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199610)28:3%3C125::AID-NET1%3E3.0.CO;2-P

zbMATH Keywords

edge-scheduled networkmultigraphtransportation networkvulnerability

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Short length Menger's theorem and reliable optical routing
• Connectivity and inference problems for temporal networks
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

Cited in

(39)

• Temporal network optimization subject to connectivity constraints
• The complexity of routing with collision avoidance
• Finding temporal paths under waiting time constraints
• The complexity of finding small separators in temporal graphs
• The complexity of finding temporal separators under waiting time constraints
• Distributed computation and reconfiguration in actively dynamic networks
• Mengerian temporal graphs revisited
• Edge-disjoint branchings in temporal digraphs
• Ranking in evolving complex networks
• Traveling salesman problems in temporal graphs
• An introduction to temporal graphs: an algorithmic perspective
• On a function for the vulnerability of a directed flow network
• A model for dynamic communicators
• Faster exploration of degree-bounded temporal graphs
• The complexity of finding small separators in temporal graphs
• Edge-Disjoint Branchings in Temporal Graphs
• scientific article; zbMATH DE number 7559396 (Why is no real title available?)
• Union of random minkowski sums and network vulnerability analysis
• An introduction to temporal graphs: an algorithmic perspective
• Connectivity and inference problems for temporal networks
• Feedback edge sets in temporal graphs
• Edge exploration of temporal graphs
• Finding Temporal Paths Under Waiting Time Constraints.
• Mengerian graphs: characterization and recognition
• The complexity of growing a graph
• 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
• Temporal reachability minimization: delaying vs. deleting
• Snapshot disjointness in temporal graphs
• The complexity of growing a graph
• A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
• On the parameterized complexity of computing good edge-labelings
• Disjoint temporal walks under waiting time constraints
• Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
• Increasing paths in random temporal graphs
• Temporal connectivity: coping with foreseen and unforeseen delays
• Novel complexity results for temporal separators with deadlines
• Simple, strict, proper, and directed: comparing reachability in directed and undirected temporal graphs
• On the treewidth of dynamic graphs

This page was built for publication:

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