The following pages link to Computing and Combinatorics (Q4681173):
Displaying 8 items.
- A survey on enhanced subspace clustering (Q362155) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- The maximum clique problem (Q1318271) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- Community detection in large-scale networks: a survey and empirical evaluation (Q6604435) (← links)
