Pages that link to "Item:Q1600883"

The following pages link to An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883):

Displaying 45 items.

• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
• Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
• Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
• Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← 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)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
• Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• Finding lasting dense subgraphs (Q2218373) (← links)
• Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← 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)
• On the maximum small-world subgraph problem (Q2327623) (← links)
• Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• The triangle \(k\)-club problem (Q2359790) (← links)
• On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Finding disjoint dense clubs in a social network (Q2636493) (← 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)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← 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)
• Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
• Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
• Covering a Graph with Clubs (Q5377354) (← links)
• On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)