For the most recent entries see the Petri Nets Newsletter.

A Method for Finding Extremal Subgraphs in Bipartite Graphs.

Gorshkov, A.F.

In: Izv. Akad. Nauk SSSR Tekhn. Kibernet., No. 4, pages 136-142. 1986. In Russian.

Also in: Soviet Journal of Computer and Systems Sciences, Vol. 25, No. 1, pages 85-91. 1987. English translation.

Abstract: A formal apparatus for solving a certain class of extremal problems in bipartite graphs with weighted edges and specified node degrees is proposed. The class of problems that can be solved by the given method includes problems in transport planning, Petrinet minimization, the traveling salesman problem, etc.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography