Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time 论文

2010Lecture notes in computer science引用 358
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchLimits and Structures in Graph Theory

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time · 相关技术