A graph‐theoretic definition of a sociometric clique†

Cites work

An Analysis of Some Graph Theoretical Cluster Techniques
On Some Clustering Techniques

Cited in

(67)

Structural consequences of individual position in nondyadic social networks
Structures induced by collections of subsets: A hypergraph approach
Combined stress and human performance: A weighted digraph model
Nonmetric grouping: clusters and cliques
An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Optimal approximation algorithms for maximum distance-bounded subgraph problems
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
Multivariate algorithmics for finding cohesive subnetworks
On detecting maximal quasi antagonistic communities in signed graphs
Heuristics for finding \(k\)-clubs in an undirected graph
Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
Hardness and tractability of the \(\gamma\)-complete subgraph problem
Data-driven RANS closures for wind turbine wakes under neutral conditions
Subexponential algorithm for d-cluster edge deletion: exception or rule?
Parsimonious formulations for low-diameter clusters
Graph signatures: identification and optimization
Data-driven RANS closures for three-dimensional flows around bluff bodies
An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
The triangle \(k\)-club problem
Complex networks: structure and dynamics
A diffusion model for churn prediction based on sociometric theory
On the tractability of finding disjoint clubs in a network
Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
Novel approaches for analyzing biological networks
Finding disjoint dense clubs in a social network
Formalising and detecting community structures in real world complex networks
Approximating maximum diameter-bounded subgraph in unit disk graphs
Distance-based clique relaxations in networks: s-clique and s-club
On the 2-club polytope of graphs
Dense subgraphs in biological networks
An ellipsoidal bounding scheme for the quasi-clique number of a graph
Optimal approximation algorithms for maximum distance-bounded subgraph problems
On fuzzy cliques in fuzzy networks
Graph theoretic blockings k‐plexes and k‐cutpoints
Finding clubs in graph classes
Clustering representations of group overlap†
A graph‐theoretic generalization of the clique concept
The emergence of groups in the evolution of friendship networks
On inclusionwise maximal and maximum cardinality k-clubs in graphs
A graph-based active learning method for classification of remote sensing images
Finding Disjoint Dense Clubs in an Undirected Graph
Finding large k-clubs in undirected graphs
Structural cohesion and embeddedness in two-mode networks
On Fault-Tolerant Low-Diameter Clusters in Graphs
Approximating maximum diameter-bounded subgraph in unit disk graphs
Finding overlapping communities in networks by label propagation
Integer models and upper bounds for the 3-club problem
Games of social interactions with local and global externalities
Covering a graph with clubs
Upper bounds and heuristics for the 2-club problem
On the tractability of covering a graph with 2-clubs
s-club cluster vertex deletion on interval and well-partitioned chordal graphs
Genetic Underpinnings of Brain Structural Connectome for Young Adults
On maximum ratio clique relaxations
Algorithms for 2-club cluster deletion problems using automated generation of branching rules
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
On the parameterized complexity of s-club cluster deletion problems
On the parameterized complexity of \(s\)-club cluster deletion problems
Finding conserved low-diameter subgraphs in social and biological networks
Covering a graph with densest subgraphs
A dynamic programming algorithm for the maximum s-club problem on trees
Rank-sparsity decomposition for planted quasi clique recovery
A branch-and-bound approach for maximum quasi-cliques
LS sets as cohesive subsets of graphs and hypergraphs
The cohesiveness of subgroups in social networks: A view from game theory

This page was built for publication: A graph‐theoretic definition of a sociometric clique†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051973)