Finding large k-clubs in undirected graphs
From MaRDI portal
Publication:488393
DOI10.1007/S00607-012-0263-3zbMATH Open1310.05195OpenAlexW1988659376MaRDI QIDQ488393FDOQ488393
Ling-Ju Hung, Ping-Chen Su, Chih-Ren Lin, Maw-Shang Chang
Publication date: 26 January 2015
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-012-0263-3
Recommendations
- Algorithms for the maximum \(k\)-club problem in graphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A measure & conquer approach for the analysis of exact algorithms
- A new approach to dynamic all pairs shortest paths
- Novel approaches for analyzing biological networks
- On clusterings
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Graph Clustering and Minimum Cut Trees
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Solving the maximum clique problem using a tabu search approach
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Heuristics for finding \(k\)-clubs in an undirected graph
- Algorithms for the maximum \(k\)-club problem in graphs
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Integer models and upper bounds for the 3‐club problem
- Upper bounds and heuristics for the 2-club problem
- Parameterized computational complexity of finding small-diameter subgraphs
- Approximating Maximum Diameter-Bounded Subgraphs
- A graph‐theoretic definition of a sociometric clique†
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Semi-dynamic shortest paths and breadth-first search in digraphs
Cited In (23)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- On the tractability of finding disjoint clubs in a network
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Computing dense and sparse subgraphs of weakly closed graphs
- On structural parameterizations for the 2-club problem
- Finding disjoint dense clubs in a social network
- Finding Disjoint Dense Clubs in an Undirected Graph
- The parameterized complexity of \(s\)-club with triangle and seed constraints
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- On the 2-Club Polytope of Graphs
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
- The parameterized complexity of \(s\)-club with triangle and seed constraints
- A hybrid artificial immune network for detecting communities in complex networks
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- On the tractability of covering a graph with 2-clubs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Covering a Graph with Clubs
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Multivariate algorithmics for finding cohesive subnetworks
Uses Software
This page was built for publication: Finding large \(k\)-clubs in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488393)
