Pages that link to "Item:Q2407101"
From MaRDI portal
The following pages link to Exact algorithms for maximum induced matching (Q2407101):
Displaying 10 items.
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Attribute selection using contranominal scales (Q2670898) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
- An improved kernel and parameterized algorithm for almost induced matching (Q6636070) (← links)
