Enumeration of minimal control sets of vertices in oriented graph

Gurami Sh. Tsitsiashvili, Yu.N. Kharchenko, A.S. Losev, Марина Анатольевна Осипова · Applied Mathematical Sciences · 2014

In this paper new algorithm of oriented graph factorization with square complexity is constructed. This algorithm allows to enumerate all control sets of graph vertices. Appropriate numerical experiment is made. Mathematics Subject Classification: 605C80

Read the paper · More papers on PaperTik