Hamiltonian path

Science formelle
Mathématiques
Mathématiques discrètes
Théorie des graphes

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (26)

On Lightning Electromagnetic Field Propagation Along an Irregular Terrain

Mario Paolone, Marcos Rubinstein, Mohammad Azadifar, Farhad Rachidi-Haeri, Zhaoyang Wang, Stefan Metz, Davide Pavanello, Dongshuai Li, Qilin Zhang

In this paper, we present a theoretical analysis of the propagation effects of lightning electromagnetic fields over a mountainous terrain. The analysis is supported by experimental observations consisting of simultaneous records of lightning currents and ...

Institute of Electrical and Electronics Engineers2016

Low rank differential equations for Hamiltonian matrix nearness problems

Daniel Kressner

For a Hamiltonian matrix with purely imaginary eigenvalues, we aim to determine the nearest Hamiltonian matrix such that some or all eigenvalues leave the imaginary axis. Conversely, for a Hamiltonian matrix with all eigenvalues lying off the imaginary axi ...

Springer2015

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

How to Localize Ten Microphones in One Fingersnap

Martin Vetterli, Ivan Dokmanic

A compelling method to calibrate the positions of microphones in an array is with sources at unknown locations. Remarkably, it is possible to reconstruct the locations of both the sources and the receivers, if their number is larger than some prescribed mi ...

IEEE2014

Resting-brain functional connectivity predicted by analytic measures of network communication

Jean-Philippe Thiran, Alessandra Griffa, Patric Hagmann, Olaf Sporns

6 The complex relationship between structural and functional connectivity, as measured by noninvasive imaging of the human brain, poses many unresolved challenges and open questions. Here, we apply analytic measures of network communication to the structur ...

National Academy of Sciences2014

A result on flip-graph connectivity

Lionel Pournin

A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fa ...

Walter de Gruyter2012

Page 2 sur 2