(Almost-)optimal FPT algorithm and kernel for T-cycle on planar graphs
From MaRDI portal
(Almost-)optimal FPT algorithm and kernel for \(T\)-cycle on planar graphs
Cites work
- (Meta) kernelization
- A nine point theorem for 3-connected graphs
- Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
- Advice classes of parametrized tractability
- Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
- An Improved Algorithm for Finding Cycles Through Elements
- Any four independent edges of a 4-connected graph are contained in a circuit
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Circuits containing specified edges
- Circuits through specified edges
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Cycles through specified vertices of a graph
- Determinant sums for undirected Hamiltonicity
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Faster deterministic parameterized algorithm for k-path
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 7053391 (Why is no real title available?)
- scientific article; zbMATH DE number 7788351 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Irrelevant vertices for the planar disjoint paths problem
- Kernelization. Theory of parameterized preprocessing
- Narrow sieves for parameterized paths and packings
- Note on circuits containing specified edges
- On circuits through five edges
- On problems without polynomial kernels
- On subexponential parameterized algorithms for Steiner tree and directed subset TSP on planar graphs
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Parameterized algorithm for the disjoint path problem on planar graphs: exponential in k^2 and linear in n
- Parameterized algorithms
- Planar disjoint paths, treewidth, and kernels
- Polynomial bounds for the grid-minor theorem
- Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements
- Rooted routing in the plane
- The directed subgraph homeomorphism problem
- The disjoint paths problem in quadratic time
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- The subgraph homeomorphism problem
- Tight bounds for linkages in planar graphs
This page was built for publication: (Almost-)optimal FPT algorithm and kernel for \(T\)-cycle on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363168)
