Pages that link to "Item:Q4168811"
From MaRDI portal
The following pages link to A graph‐theoretic generalization of the clique concept (Q4168811):
Displaying 21 items.
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- On fuzzy cliques in fuzzy networks (Q3818849) (← links)
- Graph theoretic blockings k‐plexes and k‐cutpoints (Q3968882) (← links)
- The emergence of groups in the evolution of friendship networks (Q4353469) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- Structural cohesion and embeddedness in two-mode networks (Q5033348) (← links)
- (Q5091230) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
