New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
From MaRDI portal
(Redirected from Publication:5091022)
Recommendations
- On the \(k\)-edge-incident subgraph problem and its variants
- \(k\)-edge subgraph problems
- The parameterized complexity of k-edge induced subgraphs
- The Parameterized Complexity of k-Edge Induced Subgraphs
- scientific article; zbMATH DE number 38102
- scientific article; zbMATH DE number 11360
- Publication:4206775
- scientific article; zbMATH DE number 4183456
- An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem
- An efficient algorithm for enumerating induced subgraphs with bounded degeneracy
Cites work
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- A characterization of the graphs in which the transversal number equals the matching number
- A kernel of order 2k-c k for vertex cover
- A new kernel for parameterized Max-Bisection above tight lower bound
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
- Almost 2-SAT is fixed-parameter tractable
- Altruistically unbalanced kidney exchange
- Approximation and intractability results for the maximum cut problem and its variants
- Bisections above Tight Lower Bounds
- Combinatorial and spectral properties of König-Egerváry graphs
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- Critical independent sets and König-Egerváry graphs
- Ear-decompositions of matching-covered graphs
- Efficient partnership formation in networks
- Faster parameterized algorithms using linear programming
- Forbidden subgraphs and the König-Egerváry property
- Graph theory with applications
- scientific article; zbMATH DE number 2119674 (Why is no real title available?)
- Improved Parameterized Upper Bounds for Vertex Cover
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- König Deletion Sets and Vertex Covers above the Matching Size
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- LP can be a cure for parameterized problems
- Matching theory
- On approximability of optimization problems related to red/blue-split graphs
- On maximum matchings in König-Egerváry graphs
- On two extensions of equimatchable graphs
- Paths, flowers and vertex cover
- Paths, Trees, and Flowers
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Reducibility among combinatorial problems
- Soliton circuits and network-based automata: review and perspectives
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
- The complexity of König subgraph problems and above-guarantee vertex cover
- Two more characterizations of König-Egerváry graphs
Cited in
(2)
This page was built for publication: New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091022)
