Pages that link to "Item:Q4185818"
From MaRDI portal
The following pages link to Cliques of a graph-variations on the Bron-Kerbosch algorithm (Q4185818):
Displaying 10 items.
- Constrained distributed optimization: a population dynamics approach (Q286257) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- A polynomial algorithm for constructing the clique graph of a line graph (Q1075338) (← links)
- The maximum clique problem (Q1318271) (← links)
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- A graph‐theoretic generalization of the clique concept (Q4168811) (← links)