Parameterized complexity of secluded connectivity problems (Q2408560): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60488378 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.03989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computation and extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secluded connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: Parameterized Complexity of Secluded Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-dimension of perimeter visibility domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secluded Path via Shortest Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank

Latest revision as of 12:57, 14 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of secluded connectivity problems
scientific article

    Statements

    Parameterized complexity of secluded connectivity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2017
    0 references
    secluded path
    0 references
    secluded Steiner tree
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references

    Identifiers

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