Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...