Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases

Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases

Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1. Hence making it was possible used in the Hamiltonian cycle enumeration proced...

Descripció completa

Dades bibliogràfiques
Autor principal: Retno MAHARESI
Format: Article
Idioma:English
Publicat: Stefan cel Mare University of Suceava 2016-04-01
Col·lecció:Journal of Applied Computer Science & Mathematics
Matèries:
enumeration
Hamiltonian cycle
planar
cycle bases
connected graph
Accés en línia:http://jacsm.ro/view/?pid=21_6

Internet

http://jacsm.ro/view/?pid=21_6

Ítems similars