Efficient algorithms for the longest path problem
From MaRDI portal
Recommendations
- Algorithms for long paths in graphs
- Efficient Algorithms for Solving the Shortest Covering Path Problem
- Efficient algorithms for path problems with general cost criteria
- Efficient Shortest Path Simplex Algorithms
- scientific article; zbMATH DE number 682567
- An approximation algorithm for computing longest paths.
- Faster algorithms for the shortest path problem
- An Efficient Algorithm for the Uniform Maximum Distance Problem on a Chain
- Algorithms for the quickest path problem and the enumeration of quickest paths
Cited in
(46)- The longest path problem is polynomial on cocomparability graphs
- On partial Grundy coloring of bipartite graphs and chordal graphs
- The maximum binary tree problem
- Algorithmic aspects of secure connected domination in graphs
- Algorithmic aspects of Roman domination in graphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Linear structure of bipartite permutation graphs and the longest path problem
- Computing and counting longest paths on circular-arc graphs in polynomial time
- QUBO formulations of the longest path problem
- Complexity aspects of variants of independent Roman domination in graphs
- An approximation algorithm for the longest cycle problem in solid grid graphs
- Computing and counting longest paths on circular-arc graphs in polynomial time
- A linear time algorithm for computing longest paths in 2-trees.
- The longest path problem is polynomial on cocomparability graphs
- On computing longest paths in small graph classes
- A polynomial time algorithm for longest paths in biconvex graphs
- The Longest Path Problem Is Polynomial on Interval Graphs
- Programming and testing a two-tree algorithm
- scientific article; zbMATH DE number 3948312 (Why is no real title available?)
- Efficient Algorithms for Solving the Shortest Covering Path Problem
- Secure total domination in chain graphs and cographs
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Total vertex-edge domination in graphs: Complexity and algorithms
- Complexity issues of perfect Roman domination in graphs
- Independent Roman \(\{3\}\)-domination
- A linear time algorithm for computing longest paths in cactus graphs
- Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor
- Algorithmic complexity of weakly connected Roman domination in graphs
- The Maximum Binary Tree Problem.
- Tropical paths in vertex-colored graphs
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Algorithmic aspects of certified domination in graphs
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- Dendrograms, minimum spanning trees and feature selection
- The longest path problem has a polynomial solution on interval graphs
- L(2,1)-labeling of perfect elimination bipartite graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Total 2-rainbow domination in graphs: complexity and algorithms
- Data-driven dynamic police patrolling: an efficient Monte Carlo tree search
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- Algorithmic aspects of total Roman and total double Roman domination in graphs
This page was built for publication: Efficient algorithms for the longest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712173)
