Path Problems in Complex Networks
From MaRDI portal
Publication:2913787
Recommendations
- Path problems in networks
- scientific article; zbMATH DE number 4147534
- Path Problems in Structured Graphs
- scientific article; zbMATH DE number 1810469
- scientific article; zbMATH DE number 1340882
- The problems of selecting an optimal path on network
- scientific article; zbMATH DE number 1042760
- A problems of selecting a optimal path on network
- scientific article; zbMATH DE number 1783111
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1931805 (Why is no real title available?)
- scientific article; zbMATH DE number 1830756 (Why is no real title available?)
- scientific article; zbMATH DE number 793950 (Why is no real title available?)
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- A Tournament Problem
- A dual algorithm for the constrained shortest path problem
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A note on two problems in connexion with graphs
- A quick method for finding shortest pairs of disjoint paths
- Algorithmic graph theory and perfect graphs
- Algorithms for finding paths with multiple constraints
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Disjoint paths in a network
- Distributed algorithms for computing shortest pairs of disjoint paths
- Distributed shortest-path protocols for time-dependent networks
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- Graph theory with applications
- Intersection graphs of paths in a tree
- Linear broadcast routing
- Minimum weight paths in time-dependent networks
- On a multicriteria shortest path problem
- On a routing problem
- On cliques in graphs
- On generating all maximal independent sets
- On multiroute maximum flows in networks.
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Solving k-shortest and constrained shortest path problems efficiently
- The complexity of finding two disjoint paths with min-max objective function
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Time-varying shortest path problems with constraints
Cited in
(8)- Path problems in networks
- scientific article; zbMATH DE number 1810469 (Why is no real title available?)
- On multi-path routing for reliable communications in failure interdependent complex networks
- scientific article; zbMATH DE number 4147534 (Why is no real title available?)
- scientific article; zbMATH DE number 1340882 (Why is no real title available?)
- Domain clustering for inter-domain path computation speed-up
- scientific article; zbMATH DE number 6161596 (Why is no real title available?)
- The 2-path network problem
This page was built for publication: Path Problems in Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913787)