Path Problems in Complex Networks
From MaRDI portal
Publication:2913787
DOI10.1007/978-1-4614-0754-6_11zbMath1250.05101OpenAlexW67529702MaRDI QIDQ2913787
Publication date: 27 September 2012
Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_11
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The complexity of finding two disjoint paths with min-max objective function
- On a multicriteria shortest path problem
- Solving k-shortest and constrained shortest path problems efficiently
- Intersection graphs of paths in a tree
- On generating all maximal independent sets
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Algorithmic graph theory and perfect graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- On multiroute maximum flows in networks
- On a routing problem
- Algorithms for finding paths with multiple constraints
- A quick method for finding shortest pairs of disjoint paths
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- A dual algorithm for the constrained shortest path problem
- Minimum weight paths in time-dependent networks
- Disjoint paths in a network
- A New Algorithm for Generating All the Maximal Independent Sets
- Distributed algorithms for computing shortest pairs of disjoint paths
- Time-varying shortest path problems with constraints
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Linear broadcast routing
- Distributed shortest-path protocols for time-dependent networks
- A Tournament Problem
- On cliques in graphs
