Communications of the ACM

Finding All Cliques of an Undirected Graph

作者:
Bron C. and Kerbosch J.

关键词:
backtracking algorithm branch and bound technique cliques clusters maximal complete subgraphs recursion

摘要:
Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional ...

在线下载

相关文章:
在线客服:
对外合作:
联系方式:400-6379-560
投诉建议:feedback@hanspub.org
客服号

人工客服,优惠资讯,稿件咨询
公众号

科技前沿与学术知识分享