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 13 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)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
