Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2883786747
@@ Property / OpenAlex ID: W2883786747 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07516
@@ Property / arXiv ID: 1807.07516 / rank @@
+Normal rank
@@ Property / cites work @@
+An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
+Normal rank
@@ Property / cites work @@
+Optimal approximation algorithms for maximum distance-bounded subgraph problems
+Normal rank
@@ Property / cites work @@
+On robust clusters of minimum cardinality in networks
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Heuristics for finding \(k\)-clubs in an undirected graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum \(k\)-club problem in an undirected graph
+Normal rank
@@ Property / cites work @@
+Upper bounds and heuristics for the 2-club problem
+Normal rank
@@ Property / cites work @@
+The triangle \(k\)-club problem
@@ Property / cites work: The triangle \(k\)-club problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding large \(k\)-clubs in undirected graphs
@@ Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Vertex Connectivity of Graphs
@@ Property / cites work: Finding the Vertex Connectivity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum clique problem using a tabu search approach
+Normal rank
@@ Property / cites work @@
+Finding clubs in graph classes
@@ Property / cites work: Finding clubs in graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
+Normal rank
@@ Property / cites work @@
+On structural parameterizations for the 2-club problem
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Multivariate algorithmics for finding cohesive subnetworks
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+Managing and mining graph data
@@ Property / cites work: Managing and mining graph data / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
+Normal rank
@@ Property / cites work @@
+On clique relaxation models in network analysis
@@ Property / cites work: On clique relaxation models in network analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized computational complexity of finding small-diameter subgraphs
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank
@@ Property / cites work @@
+Finding maximum subgraphs with relatively large vertex connectivity
+Normal rank
@@ Property / cites work @@
+On biconnected and fragile subgraphs of low diameter
+Normal rank
@@ Property / Wikidata QID @@
+Q128701273
@@ Property / Wikidata QID: Q128701273 / rank @@
+Normal rank