Graph motif problems parameterized by dual
From MaRDI portal
Recommendations
- Graph motif problems parameterized by dual
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
- The graph motif problem parameterized by the structure of the input graph
- The graph motif problem parameterized by the structure of the input graph
- Deterministic parameterized algorithms for the graph motif problem
Cites work
- A general method to speed up fixed-parameter-tractable algorithms
- Algorithmic aspects of the maximum colorful arborescence problem
- Algorithms for topology-free and alignment network queries
- Constrained multilinear detection and generalized graph motifs
- Deterministic parameterized algorithms for the graph motif problem
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Exact exponential algorithms.
- Fundamentals of parameterized complexity
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization Lower Bounds by Cross-Composition
- On structural parameterizations of graph motif and chromatic number
- On the Kernelization Complexity of Colorful Motifs
- On the maximum colorful arborescence problem and color hierarchy graph structure
- On the parameterized complexity of multiple-interval graph problems
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Parameterized algorithms
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- The graph motif problem parameterized by the structure of the input graph
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: Graph motif problems parameterized by dual
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119384)
