scientific article; zbMATH DE number 1420901
From MaRDI portal
Publication:4944970
zbMath0941.05052MaRDI QIDQ4944970
Publication date: 3 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (30)
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem ⋮ Maximum matching in multi-interface networks ⋮ Parameterized complexity of perfectly matched sets ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Locally searching for large induced matchings ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Analysis of greedy algorithms on graphs with bounded degrees ⋮ Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier ⋮ On the induced matching problem ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ Two greedy consequences for maximum induced matchings ⋮ Generalizing the induced matching by edge capacity constraints ⋮ Approximating weighted induced matchings ⋮ Approximation hardness of dominating set problems in bounded degree graphs ⋮ Maximum regular induced subgraphs in \(2P_3\)-free graphs ⋮ Induced Matchings in Graphs of Degree at Most 4 ⋮ On the approximability of the maximum induced matching problem ⋮ Approximating maximum acyclic matchings by greedy and local search strategies ⋮ Generalized subgraph-restricted matchings in graphs ⋮ Maximum weight induced matching in some subclasses of bipartite graphs ⋮ Maximum induced matching of hexagonal graphs ⋮ Some bounds on the maximum induced matching numbers of certain grids ⋮ Efficient edge domination in regular graphs ⋮ On the induced matching problem in Hamiltonian bipartite graphs ⋮ Induced Matchings in Graphs of Bounded Maximum Degree ⋮ The parameterized complexity of the induced matching problem ⋮ Recent progress on strong edge-coloring of graphs ⋮ The \(\text{v} \)-number of monomial ideals ⋮ Maximum induced matchings of random cubic graphs
This page was built for publication:
