Distance-based clique relaxations in networks: s-clique and s-club
From MaRDI portal
Publication:2820114
DOI10.1007/978-1-4614-8588-9_10zbMATH Open1344.90064OpenAlexW2203716775MaRDI QIDQ2820114FDOQ2820114
Authors: Shahram Shahinpour, Sergiy Butenko 
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_10
Recommendations
Cites Work
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Unit disk graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Proof verification and the hardness of approximation problems
- Probabilistic checking of proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search
- A fast algorithm for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Title not available (Why is that?)
- A graph‐theoretic generalization of the clique concept
- New methods to color the vertices of a graph
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Solving the maximum clique problem using a tabu search approach
- Title not available (Why is that?)
- Strong computational lower bounds via parameterized complexity
- An exact algorithm for the maximum clique problem
- Competition in a deregulated air transportation market
- 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
- Airline network design and hub location problems
- 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
- Clique relaxation models in social network analysis
- 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
- The maximum degree \& diameter-bounded subgraph and its applications
- On approximating the maximum diameter ratio of graphs
- On connected dominating sets of restricted diameter
- Graph domination, coloring and cliques in telecommunications
- And What Is Your Erdos Number?
Cited In (16)
- Parsimonious formulations for low-diameter clusters
- On biconnected and fragile subgraphs of low diameter
- Projection-based link prediction in a bipartite network
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
- Density-based modularity for evaluating community structure in bipartite networks
- Graph signatures: identification and optimization
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- On the 2-club polytope of graphs
- Finding disjoint dense clubs in a social network
- Finding Disjoint Dense Clubs in an Undirected Graph
- Asymptotic bounds for clustering problems in random graphs
- On clique relaxation models in network analysis
- Finding conserved low-diameter subgraphs in social and biological networks
- Clique relaxation models in social network analysis
- Multivariate algorithmics for finding cohesive subnetworks
This page was built for publication: Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820114)
