Pages that link to "Item:Q448967"
From MaRDI portal
The following pages link to On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967):
Displayed 28 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← 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)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- On computing large temporal (unilateral) connected components (Q6182912) (← links)