A graph‐theoretic definition of a sociometric clique†

Cites Work

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

Cited In (65)

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

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)