Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems

The Hamiltonian cycle and path problems are fundamental in graph theory and useful in modelling real-life problems. Research in this area is directed toward designing better and better algorithms for general problems, but also toward defining new special cases for which exact polynomial-time algorit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Informatica (Vilnius, Lithuania) Lithuania), 2024, Vol.35 (4), p.807-816
1. Verfasser:	Kasprzak, Marta
Format:	Artikel
Sprache:	eng
Schlagworte:	Adjoints Algorithms Gene sequencing Graph theory Graphs Modelling Polynomials
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!