scientific article
From MaRDI portal
Publication:2921667
zbMath1297.05140MaRDI QIDQ2921667
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
An approximation algorithm for the longest cycle problem in solid grid graphs ⋮ The Longest Path Problem Is Polynomial on Interval Graphs ⋮ The longest path problem has a polynomial solution on interval graphs ⋮ On the approximability of some degree-constrained subgraph problems ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ The Longest Path Problem is Polynomial on Cocomparability Graphs ⋮ Approximating the maximum clique minor and some subgraph homeomorphism problems ⋮ A linear-time algorithm for the longest path problem in rectangular grid graphs ⋮ On a simple randomized algorithm for finding a 2-factor in sparse graphs
This page was built for publication:
