Pages that link to "Item:Q439496"

The following pages link to Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496):

Displaying 37 items.

• Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← 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)
• On robust clusters of minimum cardinality in networks (Q513606) (← links)
• Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
• Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' (Q1634803) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← 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)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← 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)
• 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)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• The triangle \(k\)-club problem (Q2359790) (← links)
• Approximating 2-cliques in unit disk graphs (Q2636809) (← 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)
• 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)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)