A graph‐theoretic generalization of the clique concept
From MaRDI portal
Publication:4168811
DOI10.1080/0022250X.1978.9989883zbMath0386.92015MaRDI QIDQ4168811
B. L. Foster, Stephen B. Seidman
Publication date: 1978
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (05C99) Mathematical sociology (including anthropology) (91D99)
Related Items (68)
Structural cohesion and embeddedness in two-mode networks ⋮ Approximating Bounded Degree Deletion via Matroid Matching ⋮ Graph theoretic blockings k‐plexes and k‐cutpoints ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ Moderately exponential time algorithms for the maximum bounded-degree-1 set problem ⋮ Isolation concepts for efficiently enumerating dense subgraphs ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Detecting robust cliques in graphs subject to uncertain edge failures ⋮ Finding disjoint dense clubs in a social network ⋮ Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection ⋮ Subjective interestingness of subgraph patterns ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ On a generalization of Nemhauser and Trotter's local optimization theorem ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ Online summarization of dynamic graphs using subjective interestingness for sequential data ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem ⋮ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Finding clubs in graph classes ⋮ Approximating power node-deletion problems ⋮ On maximum ratio clique relaxations ⋮ Co-2-plex polynomials ⋮ Maximum weight t-sparse set problem on vector-weighted graphs ⋮ On solving simplified diversified top-\(k\,s\)-plex problem ⋮ Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems ⋮ On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs ⋮ Discovery of extreme events-related communities in contrasting groups of physical system networks ⋮ Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ Structures induced by collections of subsets: A hypergraph approach ⋮ The analysis of semigroups of multirelational systems ⋮ A generalization of a theorem of Hoffman ⋮ Editing graphs into disjoint unions of dense clusters ⋮ The emergence of groups in the evolution of friendship networks ⋮ A generalization of Nemhauser and Trotter's local optimization theorem ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Co-2-plex vertex partitions ⋮ On fuzzy cliques in fuzzy networks ⋮ Graph signatures: identification and optimization ⋮ A branch-and-price-and-cut method for computing an optimal bramble ⋮ Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number ⋮ On making a distinguished vertex of minimum degree by vertex deletion ⋮ Parameterized computational complexity of finding small-diameter subgraphs ⋮ Unnamed Item ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ A network-based data mining approach to portfolio selection via weighted clique relaxations ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ A Parameterized Algorithm for Bounded-Degree Vertex Deletion ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing ⋮ On bounded-degree vertex deletion parameterized by treewidth ⋮ Approximating Partially Bounded Degree Deletion on Directed Graphs ⋮ Finding weighted \(k\)-truss communities in large networks ⋮ Shapley value for TU-games with multiple memberships and externalities ⋮ Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ On structural parameterizations for the 2-club problem ⋮ LS sets as cohesive subsets of graphs and hypergraphs ⋮ Optimization problems for the maximum \(k\)-plex ⋮ Structural consequences of individual position in nondyadic social networks ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
Cites Work
This page was built for publication: A graph‐theoretic generalization of the clique concept
