scientific article; zbMATH DE number 6297714
From MaRDI portal
Publication:5417631
Recommendations
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Parameterized algorithms for even cycle transversal
- On the optimal transversals of the odd cycles
- Subexponential parameterized odd cycle transversal on planar graphs
- Complexity of cycle transverse matching problems
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Odd cycle transversal in mixed graphs
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
- Linear algorithm for a cyclic graph transformation
Cited in
(25)- Faster graph bipartization
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Modifying a graph using vertex elimination
- Another disjoint compression algorithm for odd cycle transversal
- Odd cycle transversal in mixed graphs
- Odd cycle packing
- On polynomial kernels for structural parameterizations of odd cycle transversal
- Subexponential parameterized odd cycle transversal on planar graphs
- Linear time parameterized algorithms for subset feedback vertex set
- The parameterized complexity of finding point sets with hereditary properties
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- Parameterized algorithms for even cycle transversal
- Hitting selected (odd) cycles
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Edge bipartization faster than \(2^k\)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- The maximum independent set problem on circulant graphs C_n ( a, b )
- Integer programs with bounded subdeterminants and two nonzeros per row
- Dynamic programming on bipartite tree decompositions
- Decremental sensitivity oracles for covering and packing minors
- Dynamic programming on bipartite tree decompositions
- Odd cycle transversal on P₅-free graphs in polynomial time
- True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
- Finding odd cycle transversals.
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 Q5417631)
