From: Vertex collocation profiles: theory, computation, and results
Algorithm
Complexity
Pairwise-independent
optimality
VCP 3,r,d (Naïve)
O | V | log | E | | V |
VCP 3,r,d
O | E | | V |
✓
VCP 4,r,d (Naïve)
O | V | 2 log | E | | V |
VCP 4,r,d (Improved)
O | E | | V | 2 log | E | | V |
VCP 4,r,d
O | E | | V | 2
VCP n,r,d
Ω | E | | V | n − 2
N/A