Open AccessProceedings Article
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Kai Fieger,Tomáš Balyo,Christian Schulz,Dominik Schreiber +3 more
- Vol. 10, Iss: 1, pp 61-69
TLDR
An exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs is proposed by using graph partitioning and dynamic programming which yields the first efficient parallel algorithm for the problem.Abstract:
We propose an exact algorithm for solving the longest path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that were previously unsolved and solve hard instances significantly faster. We also present a parallel version of the algorithm.read more
Citations
More filters
Journal ArticleDOI
SAT Competition 2020
TL;DR: A detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition are provided.
Proceedings Article
Solving the Longest Simple Path Problem with Heuristic Search.
TL;DR: This work first introduces several methods for pruning dominated path prefixes, then proposes several admissible heuristic functions for this problem and demonstrates the large impact of the proposed heuristics and pruning rules.
Journal ArticleDOI
Embedding linear arrays of the maximum length in O-shaped meshes
TL;DR: This paper gives a linear-time parallel algorithm for embedding of linear arrays (paths) of maximum length in O -shaped meshes and proves some upper bounds on the length of the longest paths.
Book ChapterDOI
RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots
TL;DR: This paper reports on initial experimental results with three distinct solvers, namely Gecode, SICStus and Chuffed, where RobTest, has been shown to return near-optimal solutions for trajectories encounting for more than 80 input points and 60 obstacles in less than 5 min.
References
More filters
Journal ArticleDOI
TSPLIB—A Traveling Salesman Problem Library
TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Proceedings ArticleDOI
The webgraph framework I: compression techniques
Paolo Boldi,Sebastiano Vigna +1 more
TL;DR: This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other).
Proceedings ArticleDOI
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks
TL;DR: In this paper, a layered label propagation (LBP) algorithm is proposed to reorder very large graphs (billions of nodes) using task decomposition to perform aggressively on multi-core architecture, making it possible to compress graphs of more than 600 millions nodes in a few hours.