DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Longest path problem
Longest path problem
On Computing Longest Paths in Small Graph Classes
Approximating the Maximum Clique Minor and Some Subgraph Homeomorphism Problems
Downloaded the Biochemical Pathways Information from the Saccharomyces Genome Database (SGD) [29], Which Contains for Each Enzyme of S
On Digraph Width Measures in Parameterized Algorithmics (Extended Abstract)
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Optimal Longest Paths by Dynamic Programming∗
Subexponential Parameterized Algorithms
Longest Paths in Partial 2-Trees
Efficient Algorithms for the Longest Path Problem
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs Via Low Treewidth Pattern Covering
A Note on the Complexity of Longest Path Problems Related to Graph Coloring
Longest Path in a Directed Acyclic Graph (DAG)
Depth-First Search, Topological Sort
Complexity Analysis of Some Problems in Planar Graphs, Bounded Tree-Width Graphs, and Planar Point Sets
Digraph Width Measures in Parameterized Algorithmics
Parallel Optimal Longest Path Search
NP-Hard Problems and Approximation Algorithms
A Heuristic Algorithm for Longest Simple Cycle Problem
Top View
Alfréd Rényi Math Is Hard
Graph Decomposition Based Algorithms for Maximum Path Coloring and Connected Subgraph Problems
Polynomial Fixed-Parameter Algorithms: a Case Study For
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs Via Low Treewidth Pattern Covering
The Longest Path Problem Is Polynomial on Interval Graphs
The Longest Path Problem Has a Polynomial Solution on Interval Graphs
Longest Paths in Planar Dags in Unambiguous Log-Space∗
ON the DIFFICULTY of FINDING WALKS of LENGTH K 431
The Longest Path Problem Has a Polynomial Solution on Interval Graphs.', Algorithmica., 61 (2)
Finding Detours Is Fixed-Parameter Tractable∗
Computational Study on Bidimensionality Theory Based Al- Gorithms
Finding Long Simple Paths in a Weighted Digraph Using Pseudo-Topological Orderings
A Streaming Algorithm for the Undirected Longest Path Problem∗
The Orderly Colored Longest Path Problem – Asurveyofapplicationsandnew Algorithms
Hamiltonicity and Longest Path Problem on Special Classes of Graphs
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Depth First Search & Directed Acyclic Graphs
FUNDAMENTAL PROBLEMS and ALGORITHMS Graph Theory And