Linear kernels and linear-time algorithms for finding large cuts (Q722541): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59527637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying more than half of a system of linear equations over GF(2): a multivariate approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum balanced subgraph problem parameterized above lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Max-Cut} parameterized above the Edwards-Erdős bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Subgraph Isomorphism Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Independent Sets in Triangle-Free Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Linear-Time Algorithms for Finding Large Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on maximal bisection above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs for portfolio analysis in risk management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator-based data reduction for signed graph balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-integrality, LP-branching, and FPT Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Parameterized Algorithms for Subset Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation Algorithms for the Max Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG / rank
 
Normal rank

Latest revision as of 04:56, 16 July 2024

scientific article
Language Label Description Also known as
English
Linear kernels and linear-time algorithms for finding large cuts
scientific article

    Statements

    Linear kernels and linear-time algorithms for finding large cuts (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    max-cut
    0 references
    kernelization
    0 references
    linear-time algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers