偶匹配可扩性的极图问题

设G是含有完美匹配的简单图. 称图G是偶匹配可扩的(BM-可扩的), 如果G的每一个导出子图是偶图的匹配M都可以扩充为一个完美匹配. 极图问题是图论的核心问题之一. 本文将刻画极大偶匹配不可扩图, 偶图图类和完全多部图图类中的极大偶匹配可扩图.

Development and prospect of blockchain consensus mechanism

As a decentralized infrastructure and distributed computing paradigm, blockchain technology has attracted a great attention from government departments, financial institutions, technology enterprises, capital markets, and so on. As the core advantage of blockchain technology, how to obtain an efficient consensus in the distributed system is an important issue which restricts the development and application of blockchain technology. At present, several research institutions and companies have proposed different consensus mechanisms applied in different application scenarios. In this paper, we conduct an in-depth analysis of several typical consensus mechanisms and their different deformation. Through comparison, the advantages and disadvantages of existing consensus mechanisms have been illustrated. Moreover, the basic requirements of new consensus mechanism have also been defined. Finally, some basic ideas in the designing of new consensus mechanism have been proposed.