Methods for finding paths of a prescribed length in weighted graphs
From MaRDI portal
Cites work
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Disjoint paths in a network
- Divide-and-Color
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster deterministic parameterized algorithm for k-path
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Finding the k Shortest Paths
- Graphs, algorithms, and optimization
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved algorithms for path, matching, and packing problems
- Long circuits and large Euler subgraphs
- Longest path analysis in networks of queues: dynamic scheduling problems
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- Mixing Color Coding-Related Techniques
- Narrow sieves for parameterized paths and packings
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- On a technique for finding running tracks of specific length in a road network
- On limited nondeterminism and the complexity of the V-C dimension
- On Linear Time Minor Tests with Depth-First Search
- On the difficulty of finding walks of length k
- The Complexity of Enumeration and Reliability Problems
- The Parameterized Complexity of Counting Problems
This page was built for publication: Methods for finding paths of a prescribed length in weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307384)
