Pages that link to "Item:Q3656867"
From MaRDI portal
The following pages link to Partitioning into Sets of Bounded Cardinality (Q3656867):
Displaying 15 items.
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Partition bounded sets into sets having smaller diameters (Q2038870) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Partition into Triangles on Bounded Degree Graphs (Q3075543) (← links)
- Partitions of a finite set into structured subsets (Q4133644) (← links)
- De Sitter and power-law solutions in non-local Gauss–Bonnet gravity (Q4615071) (← links)
- BIPARTITIONING INTO OVERLAPPING SETS (Q4852316) (← links)
- (Q5090495) (← links)
- (Q5743447) (← links)
- Partitioning Pairs of Countable Sets (Q5753946) (← links)
- Partition regular structures contained in large sets are abundant (Q5929833) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)