On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.12.006 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1502.07659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large minimum degree and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-restricted edge-connectivity in triangle-free 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: Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Algorithm for Mixed-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / 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: Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.12.006 / rank
 
Normal rank

Latest revision as of 19:38, 9 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
scientific article

    Statements

    On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (English)
    0 references
    0 references
    0 references
    9 January 2017
    0 references
    graph cut
    0 references
    \(k\)-restricted edge-connectivity
    0 references
    good edge separation
    0 references
    parameterized complexity
    0 references
    FPT-algorithm
    0 references
    polynomial kernel
    0 references
    0 references
    0 references
    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
    0 references