Abstract:
In this paper, symbolic matrices and a simple algebraic method to list spanning trees and find Hamiltonian circuits in a simple un-oriented graph are used. A concrete, fu...Show MoreMetadata
Abstract:
In this paper, symbolic matrices and a simple algebraic method to list spanning trees and find Hamiltonian circuits in a simple un-oriented graph are used. A concrete, fully-parallel algorithm that achieves both goals, with examples is shown. A necessary and sufficient condition for Hamiltonicity is presented, too.
Date of Conference: 29-31 August 2011
Date Added to IEEE Xplore: 13 October 2011
ISBN Information:
Contents 