scientific article

zbMATH Open0549.68066MaRDI QIDQ3341926

Burkhard Monien

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

longest cyclelongest pathefficient algorithmscycle of length kpaths of length k

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Paths of bounded length and their cuts: parameterized complexity and algorithms 👍 👎
• The complexity of minimum-length path decompositions 👍 👎
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time 👍 👎
• On the complexity of the disjoint paths problem 👍 👎
• Complexity of some inverse shortest path lengths problems 👍 👎
• Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms 👍 👎
• Finding the k Shortest Paths 👍 👎
• The Complexity of Finding Paths in Graphs with Bounded Independence Number 👍 👎

This page was built for publication: