Methods for determining cycles of a specific length in undirected graphs with edge weights
From MaRDI portal
Publication:6181338
DOI10.1007/s10878-023-01091-wOpenAlexW4388805643MaRDI QIDQ6181338
No author found.
Publication date: 22 January 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01091-w
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parameterized complexity of local search for TSP, more refined
- Weighted degrees and heavy cycles in weighted graphs
- Cycles in weighted graphs
- A 4/5 -- approximation algorithm for the maximum traveling salesman problem
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- On Linear Time Minor Tests with Depth-First Search
- An algorithm for the longest cycle problem
- Almost all regular graphs are hamiltonian
- Color-coding
- On the difficulty of finding walks of length k
- An O(nm) time algorithm for finding the min length directed cycle in a graph
- On a Technique for Finding Running Tracks of Specific Length in a Road Network
- Hamilton Paths in Grid Graphs
- Heavy cycles in weighted graphs
- Graphs, Algorithms, and Optimization
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Finding All the Elementary Circuits of a Directed Graph
- Estimating the Number of s-t Paths in a Graph
- Finding the K Shortest Loopless Paths in a Network
- Some Theorems on Abstract Graphs
- Multiplicative Parameterization Above a Guarantee
This page was built for publication: Methods for determining cycles of a specific length in undirected graphs with edge weights
