Pages that link to "Item:Q3057621"
From MaRDI portal
The following pages link to Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621):
Displayed 4 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)