Pages that link to "Item:Q2839212"
From MaRDI portal
The following pages link to Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212):
Displaying 5 items.
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)