|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 5 van 7 gevonden artikelen
| Titel: |
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem |
| Auteur: |
Blazewicz, Jacek Kasprzak, Marta |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 118 (2012) nr. 3 pagina's 225-244 |
| Jaar: |
2012-06-08 |
| Inhoud: |
The results presented in the paper are threefold. Firstly, a new class of reduced-by-matching directed graphs is defined and its properties studied. The graphs are output from the algorithm which, for a given 1-graph, removes arcs which are unnecessary from the point of view of searching for a Hamiltonian circuit. In the best case, the graph is reduced to a quasi-adjoint graph, what results in polynomial-time solution of the Hamiltonian circuit problem. Secondly, the systematization of several classes of digraphs, known from the literature and referring to directed line graphs, is provided together with the proof of its correctness. Finally, computational experiments are presented in order to verify the effectiveness of the reduction algorithm. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 5 van 7 gevonden artikelen
| << vorige | volgende >> |
Toegankelijkheidsverklaring