scientific article; zbMATH DE number 3974318
From MaRDI portal
Publication:3740256
zbMATH Open0603.68069MaRDI QIDQ3740256FDOQ3740256
Authors: Burkhard Monien 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cited In (53)
- The \(k\)-distinct language: parameterized automata constructions
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Finding and counting given length cycles
- Approximating the longest paths in grid graphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Finding a smallest odd hole in a claw-free graph using global structure
- Faster deterministic parameterized algorithm for \(k\)-path
- Spotting trees with few leaves
- Spotting trees with few leaves
- Finding monotone paths in edge-ordered graphs
- Title not available (Why is that?)
- A faster parameterized algorithm for temporal matching
- Title not available (Why is that?)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Detours in directed graphs
- Deterministic subgraph detection in broadcast CONGEST
- On approximating the longest path in a graph
- Finding even cycles even faster
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Finding detours is fixed-parameter tractable
- QUBO formulations of the longest path problem
- Complexity of searching an immobile hider in a graph
- A streaming algorithm for the undirected longest path problem
- Narrow sieves for parameterized paths and packings
- The even-path problem for graphs and digraphs
- A parameterized view on matroid optimization problems
- Gerrymandering on graphs: computational complexity and parameterized algorithms
- Finding even subgraphs even faster
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- On the complexity of database queries
- Long directed \((s,t)\)-path: FPT algorithm
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Title not available (Why is that?)
- Finding detours is fixed-parameter tractable
- On problems with short certificates
- Algorithms for long paths in graphs
- Mixing Color Coding-Related Techniques
- Maintaining longest paths incrementally
- Parameterized complexity and subexponential-time computability
- Deterministic algorithms for matching and packing problems based on representative sets
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Title not available (Why is that?)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
- Finding a Path of Superlogarithmic Length
- Parameterized algorithms for list \(K\)-cycle
- Title not available (Why is that?)
- Revising Johnson's table for the 21st century
- Representative families: a unified tradeoff-based approach
- A theory of even functionals and their algorithmic applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740256)
