Pages that link to "Item:Q4051973"
From MaRDI portal
The following pages link to A graph‐theoretic definition of a sociometric clique† (Q4051973):
Displaying 50 items.
- Finding clubs in graph classes (Q400518) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Games of social interactions with local and global externalities (Q533945) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- LS sets as cohesive subsets of graphs and hypergraphs (Q800386) (← links)
- The cohesiveness of subgroups in social networks: A view from game theory (Q926356) (← links)
- Structural consequences of individual position in nondyadic social networks (Q1068025) (← links)
- Structures induced by collections of subsets: A hypergraph approach (Q1164574) (← links)
- Combined stress and human performance: A weighted digraph model (Q1168258) (← links)
- Nonmetric grouping: clusters and cliques (Q1237490) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- On detecting maximal quasi antagonistic communities in signed graphs (Q1741135) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Data-driven RANS closures for wind turbine wakes under neutral conditions (Q2072344) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Data-driven RANS closures for three-dimensional flows around bluff bodies (Q2245405) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Complex networks: structure and dynamics (Q2406857) (← links)
- A diffusion model for churn prediction based on sociometric theory (Q2418404) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Novel approaches for analyzing biological networks (Q2576439) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- Formalising and detecting community structures in real world complex networks (Q2661873) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Dense Subgraphs in Biological Networks (Q3297795) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- On fuzzy cliques in fuzzy networks (Q3818849) (← links)
- Graph theoretic blockings k‐plexes and k‐cutpoints (Q3968882) (← links)
- Clustering representations of group overlap† (Q4120401) (← links)
- A graph‐theoretic generalization of the clique concept (Q4168811) (← links)
- The emergence of groups in the evolution of friendship networks (Q4353469) (← links)
- A graph-based active learning method for classification of remote sensing images (Q4571048) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
