Pages that link to "Item:Q4051973"
From MaRDI portal
The following pages link to A graph‐theoretic definition of a sociometric clique† (Q4051973):
Displaying 13 items.
- Structural cohesion and embeddedness in two-mode networks (Q5033348) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- Finding overlapping communities in networks by label propagation (Q5135158) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
- Covering a graph with densest subgraphs (Q6659505) (← links)