High Quality Content by WIKIPEDIA articles! In combinatorial mathematics, the series-parallel networks problem asks for the number of series-parallel networks that can be formed using a given number of edges. The edges can be distinguishable or indistinguishable. When the edges are indistinguishable, we look for the number of topologically different networks on n edges. The idea is to break-down the problem by classifying the networks as essentially series and essentially parallel networks. An essentially series network is a network which can be broken down into two or more subnetworks in series. An essentially parallel network is a network which can be broken down into two or more subnetworks in parallel.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.