Minimum Bisection Is Fixed-Parameter Tractable (Q4634024): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2937927637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Computing Graph Bisections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of computing balanced partitions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and tree structure in finite graphs / 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: Designing FPT Algorithms for Cut Problems Using Randomized Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum bisection size (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small balanced separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation 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: Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Menger-like property of tree-width: The finite case / rank
 
Normal rank

Latest revision as of 03:33, 19 July 2024

scientific article; zbMATH DE number 7051393
Language Label Description Also known as
English
Minimum Bisection Is Fixed-Parameter Tractable
scientific article; zbMATH DE number 7051393

    Statements

    Minimum Bisection Is Fixed-Parameter Tractable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2019
    0 references
    minimum bisection
    0 references
    fixed-parameter tractability
    0 references
    graph decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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