Pages that link to "Item:Q3608864"
From MaRDI portal
The following pages link to Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (Q3608864):
Displaying 7 items.
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Parameterized Algorithms for Generalized Domination (Q5505650) (← links)
- (Q6089655) (← links)