Note on maximal bisection above tight lower bound (Q1675768): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5417644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Max Lin-2 above average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover problem parameterized above and below tight bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds / 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: Fixed-parameter complexity of minimum profile problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and intractability results for the maximum cut problem and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / 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: The complexity of König subgraph problems and above-guarantee vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank

Latest revision as of 15:39, 14 July 2024

scientific article
Language Label Description Also known as
English
Note on maximal bisection above tight lower bound
scientific article

    Statements

    Note on maximal bisection above tight lower bound (English)
    0 references
    0 references
    0 references
    3 November 2017
    0 references
    algorithms
    0 references
    fixed-parameter tractability
    0 references
    kernels
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references