On the parameterized complexity of finding separators with non-hereditary properties (Q494799): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / 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: Multicut is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Movement: Fixed-Parameter Tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small balanced separators / 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: Bidimensionality and Geometric Graphs / 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: A logical approach to multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for path-transversal and cycle-transversal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant ratio fixed-parameter approximation of the edge multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of multicut parameterized by the size of the cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth reduction for constrained separation and bipartization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank

Revision as of 16:48, 10 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of finding separators with non-hereditary properties
scientific article

    Statements

    On the parameterized complexity of finding separators with non-hereditary properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    vertex separators
    0 references
    non-hereditary properties
    0 references
    parameterized complexity
    0 references
    FPT algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers