On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-53174-7_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2964059668
@@ Property / OpenAlex ID: W2964059668 / rank @@
+Normal rank
@@ Property / cites work @@
+Extraconnectivity of graphs with large minimum degree and girth
+Normal rank
@@ Property / cites work @@
+Q4737194
@@ Property / cites work: Q4737194 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-cuts leaving components of order at least three
+Normal rank
@@ Property / cites work @@
+Designing FPT Algorithms for Cut Problems Using Randomized Contractions
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum bisection is fixed parameter tractable
@@ Property / cites work: Minimum bisection is fixed parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2843923
@@ Property / cites work: Q2843923 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+On computing a conditional edge-connectivity of a graph
+Normal rank
@@ Property / cites work @@
+Extraconnectivity of graphs with large girth
@@ Property / cites work: Extraconnectivity of graphs with large girth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847903
@@ Property / cites work: Q2847903 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-restricted edge-connectivity in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Computing Graph Bisections
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+A proof of an inequality concerning \(k\)-restricted edge connectivity
+Normal rank