Pages that link to "Item:Q1349101"
From MaRDI portal
The following pages link to On approximating the maximum diameter ratio of graphs (Q1349101):
Displayed 6 items.
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)