Pages that link to "Item:Q3603551"
From MaRDI portal
The following pages link to Kernelization and Complexity Results for Connectivity Augmentation Problems (Q3603551):
Displaying 6 items.
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- (Q4634403) (← links)
- (Q6109651) (← links)