Path Problems in Complex Networks
From MaRDI portal
Publication:2913787
DOI10.1007/978-1-4614-0754-6_11zbMATH Open1250.05101OpenAlexW67529702MaRDI QIDQ2913787FDOQ2913787
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
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Title not available (Why is that?)
- Intersection graphs of paths in a tree
- Algorithmic graph theory and perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Algorithm for Generating All the Maximal Independent Sets
- The complexity of finding two disjoint paths with min-max objective function
- On cliques in graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- Disjoint paths in a network
- Distributed algorithms for computing shortest pairs of disjoint paths
- Algorithms for finding paths with multiple constraints
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Distributed shortest-path protocols for time-dependent networks
- On generating all maximal independent sets
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On a multicriteria shortest path problem
- A quick method for finding shortest pairs of disjoint paths
- On multiroute maximum flows in networks.
- Minimum weight paths in time-dependent networks
- Title not available (Why is that?)
- A dual algorithm for the constrained shortest path problem
- Solving k-shortest and constrained shortest path problems efficiently
- Time-varying shortest path problems with constraints
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- A Tournament Problem
- Title not available (Why is that?)
- Linear broadcast routing
- Title not available (Why is that?)
Cited In (6)
Recommendations
- Path problems in networks π π
- Title not available (Why is that?) π π
- Path Problems in Structured Graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- The problems of selecting an optimal path on network π π
- Title not available (Why is that?) π π
- A problems of selecting a optimal path on network π π
- Title not available (Why is that?) π π
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)