Pages that link to "Item:Q2413973"
From MaRDI portal
The following pages link to Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973):
Displaying 5 items.
- Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q5363776) (← links)