期刊
THEORETICAL COMPUTER SCIENCE
卷 282, 期 2, 页码 231-257出版社
ELSEVIER
DOI: 10.1016/S0304-3975(01)00055-X
关键词
-
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据