Pages that link to "Item:Q2407097"
From MaRDI portal
The following pages link to Finding connected \(k\)-subgraphs with high density (Q2407097):
Displaying 8 items.
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
