Pages that link to "Item:Q765346"
From MaRDI portal
The following pages link to On the complexity of isoperimetric problems on trees (Q765346):
Displaying 10 items.
- Clustering and outlier detection using isoperimetric number of trees (Q898224) (← links)
- A note on isoperimetric peaks of complete trees (Q966032) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- Computing the isoperimetric number of a graph (Q1905161) (← links)
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- (Q4258575) (← links)
- (Q4598229) (← links)
- On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (Q6559388) (← links)