Pages that link to "Item:Q3557054"
From MaRDI portal
The following pages link to Approximating Maximum Diameter-Bounded Subgraphs (Q3557054):
Displayed 14 items.
- Finding clubs in graph classes (Q400518) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)