Pages that link to "Item:Q1958629"
From MaRDI portal
The following pages link to Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629):
Displaying 5 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
