Combinatorial Algorithm for Finding Spanning Forests
Keywords:
Spanning trees, combinatorial algorithmAbstract
In this paper we present a new combinatorial algorithm for finding all different spanning forests for a disconnected graph G, depending on the adjacency matrix, the cyclomatic number, the combination between the numbers of edges and the cyclomatic number, and the permutation between the entries of the adjacency matrix to determine the spanning forests.Downloads
Published
2012-06-01
Issue
Section
Articles
How to Cite
(1)
Combinatorial Algorithm for Finding Spanning Forests. ANJS 2012, 15 (2), 152-155.