Výsledky vyhledávání - "hamiltonian graph"

Report

A Memetic Algorithm To Find a Hamiltonian Cycle in a Hamiltonian Graph

Autor: Ali, Sarwan, Moscato, Pablo

We present a memetic algorithm (\maa) approach for finding a Hamiltonian cycle in a Hamiltonian graph. The \ma is based on a proven approach to the Asymmetric Travelling Salesman Problem (\atspp) that, in this contribution, is boosted by the introduc

Externí odkaz: http://arxiv.org/abs/2403.07886

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

Discovering Symbolic Laws Directly from Trajectories with Hamiltonian Graph Neural Networks

Autor: Bishnoi, Suresh, Bhattoo, Ravinder, Jayadeva, Ranu, Sayan, Krishnan, N M Anoop

The time evolution of physical systems is described by differential equations, which depend on abstract quantities like energy and force. Traditionally, these quantities are derived as functionals based on observables such as positions and velocities

Externí odkaz: http://arxiv.org/abs/2307.05299

Zobrazit plný text záznamu

Report

Symplectic Structure-Aware Hamiltonian (Graph) Embeddings

Autor: Liu, Jiaxu, Yi, Xinping, Zhang, Tianle, Huang, Xiaowei

In traditional Graph Neural Networks (GNNs), the assumption of a fixed embedding manifold often limits their adaptability to diverse graph geometries. Recently, Hamiltonian system-inspired GNNs have been proposed to address the dynamic nature of such

Externí odkaz: http://arxiv.org/abs/2309.04885

Zobrazit plný text záznamu

Akademický článek

Hybrid Algorithm of Sparrow Algorithm and Arithmetic Optimization Algorithm Based on Hamiltonian Graph

Autor: TIAN Lu, LIU Sheng

Publikováno v: Jisuanji kexue yu tansuo, Vol 17, Iss 7, Pp 1586-1598 (2023)

Aiming at the shortcomings of sparrow search algorithm (SSA), such as decreased population diversity in the late iteration and easily falling into local optimal solution, a hybrid algorithm of sparrow search algorithm and arithmetic optimization algo

Externí odkaz: https://doaj.org/article/7000bd9882f9498db4677445e20e17b8

Zobrazit plný text záznamu

Akademický článek

CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH

Autor: Nhu An Do, Quang Tuan Nguyen

Publikováno v: Tạp chí Khoa học Đại học Đà Lạt, Vol 14, Iss 3 (2024)

Let G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph.

Externí odkaz: https://doaj.org/article/ed4ab2ddb6464be1a7a3e8b23486946b

Zobrazit plný text záznamu