Pages that link to "Item:Q1168728"
From MaRDI portal
The following pages link to NP-completeness of some generalizations of the maximum matching problem (Q1168728):
Displaying 50 items.
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- The efficiency of AC graphs (Q686253) (← links)
- Distance edge-colourings and matchings (Q714033) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Certain NP-complete matching problems (Q794163) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs (Q1199425) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Donation center location problem (Q1949758) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Number of induced matchings of graphs (Q2025191) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
