Pages that link to "Item:Q5898479"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898479):
Displaying 15 items.
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- (Q3161275) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- (Q5418133) (← links)
