Pages that link to "Item:Q1847371"
From MaRDI portal
The following pages link to On maximum induced matchings in bipartite graphs (Q1847371):
Displayed 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- The maximum fuzzy weighted matching models and hybrid genetic algorithm (Q945410) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Graph matching problems and the NP-hardness of sortedness constraints (Q2402671) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Attribute selection using contranominal scales (Q2670898) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- Regularity of bicyclic graphs and their powers (Q4960289) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)