Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for parallel and distributed computation. Theory, algorithmic techniques and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / 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 path and cycle problems / 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: New graph classes of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the model-checking of monadic second-order formulas with edge set quantifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized competitive algorithm for evaluating priced AND/OR trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Solutions to AND/OR Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the complexity of and/or graph solution / rank
 
Normal rank

Latest revision as of 14:25, 14 July 2024

scientific article
Language Label Description Also known as
English
Tractability, hardness, and kernelization lower bound for and/or graph solution
scientific article

    Statements

    Tractability, hardness, and kernelization lower bound for and/or graph solution (English)
    0 references
    0 references
    17 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    and/or graphs
    0 references
    W[P]-complete
    0 references
    W[1]-hard
    0 references
    FPT
    0 references
    tree-width
    0 references
    clique-width
    0 references
    0 references