Pages that link to "Item:Q4168811"

The following pages link to A graph‐theoretic generalization of the clique concept (Q4168811):

Displaying 50 items.

• The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
• Subjective interestingness of subgraph patterns (Q338641) (← links)
• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Finding clubs in graph classes (Q400518) (← links)
• Co-2-plex polynomials (Q411251) (← links)
• Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
• Co-2-plex vertex partitions (Q498448) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← links)
• A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
• A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
• On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
• Finding weighted \(k\)-truss communities in large networks (Q778465) (← links)
• LS sets as cohesive subsets of graphs and hypergraphs (Q800386) (← links)
• Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
• Structural consequences of individual position in nondyadic social networks (Q1068025) (← links)
• Structures induced by collections of subsets: A hypergraph approach (Q1164574) (← links)
• The analysis of semigroups of multirelational systems (Q1167680) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← 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)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• A generalization of a theorem of Hoffman (Q1719574) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
• Shapley value for TU-games with multiple memberships and externalities (Q2082785) (← links)
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Optimization problems for the maximum \(k\)-plex (Q2103796) (← links)
• Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection (Q2152709) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• Graph signatures: identification and optimization (Q2242325) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
• Discovery of extreme events-related communities in contrasting groups of physical system networks (Q2441822) (← links)
• Finding disjoint dense clubs in a social network (Q2636493) (← links)
• Online summarization of dynamic graphs using subjective interestingness for sequential data (Q2659275) (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)