scientific article
From MaRDI portal
Publication:3740256
zbMath0603.68069MaRDI QIDQ3740256
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items
Spotting Trees with Few Leaves ⋮ On problems with short certificates ⋮ Spotting Trees with Few Leaves ⋮ Mixing Color Coding-Related Techniques ⋮ Parameterized Complexity and Subexponential-Time Computability ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Narrow sieves for parameterized paths and packings ⋮ QUBO formulations of the longest path problem ⋮ Complexity of searching an immobile hider in a graph ⋮ Finding monotone paths in edge-ordered graphs ⋮ Finding even subgraphs even faster ⋮ Deterministic Subgraph Detection in Broadcast CONGEST. ⋮ Algorithms for long paths in graphs ⋮ Gerrymandering on graphs: computational complexity and parameterized algorithms ⋮ Counting Homomorphic Cycles in Degenerate Graphs ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Detours in directed graphs ⋮ Representative families: a unified tradeoff-based approach ⋮ Finding a smallest odd hole in a claw-free graph using global structure ⋮ Finding even cycles even faster ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ A theory of even functionals and their algorithmic applications ⋮ Finding and counting given length cycles ⋮ Scheduling for single agile satellite, redundant targets problem using complex networks theory ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Unnamed Item ⋮ On approximating the longest path in a graph ⋮ Finding paths of length \(k\) in \(O^{*}(2^k)\) time ⋮ Faster deterministic parameterized algorithm for \(k\)-path ⋮ Approximating the longest paths in grid graphs ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ On the complexity of finding internally vertex-disjoint long directed paths ⋮ A faster parameterized algorithm for temporal matching ⋮ A parameterized view on matroid optimization problems ⋮ Revising Johnson's table for the 21st century ⋮ On the complexity of database queries ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
