Pages that link to "Item:Q2253535"
From MaRDI portal
The following pages link to On clique relaxation models in network analysis (Q2253535):
Displaying 12 items.
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Finding groups with maximum betweenness centrality (Q5268927) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
