Have a personal or library account? Click to login
An Elementary Method of Determining Hamiltonian Paths in Oriented Graphs that Admit Circuits Cover

An Elementary Method of Determining Hamiltonian Paths in Oriented Graphs that Admit Circuits

International conference KNOWLEDGE-BASED ORGANIZATION
Volume 31 (2025): Issue 3 (June 2025)
By: Vasile Căruţaşu  
Open Access
|Jul 2025
DOI: https://doi.org/10.2478/kbo-2025-0076 | Journal eISSN: 2451-3113
Journal RSS Feed
Language: English
Page range: 31 - 36
Published on: Jul 5, 2025
Published by: Nicolae Balcescu Land Forces Academy
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Keywords:
Latin matrix method,
Y. Chen’s algorithm,
Ford-Fulkerson method,
Hamiltonian paths
Related subjects:
Business and economics,
Business management,
Management, organization, corporate governance,
Engineering,
Introductions and overviews,
Engineering, other,
Law,
Law, other,
Social sciences,
Political science,
Military policy

© 2025 Vasile Căruţaşu, published by Nicolae Balcescu Land Forces Academy
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 31 (2025): Issue 3 (June 2025)Next article