Pages that link to "Item:Q2872119"
From MaRDI portal
The following pages link to An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching (Q2872119):
Displaying 7 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)