Concept

Hamiltonian path

Publications associées (62)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Dynamic Optimization of Constrained Semi-Batch Processes Using Pontryagin’s Minimum Principle – An Effective Quasi-Newton Approach

Dominique Bonvin

This work considers the numerical optimization of constrained batch and semi-batch processes, for which direct as well as indirect methods exist. Direct methods are often the methods of choice, but they exhibit certain limitations related to the compromise ...

2016

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 ...

Springer Heidelberg2015

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 ...

Natl Acad Sciences2014

The flip-graph of the 4-dimensional cube is connected

Lionel Pournin

Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence, that this vertex set admits 92487256 triangulations, partitioned into 247451 symmetry classes. ...

Springer-Verlag2013

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

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

Ieee2012

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

IEEE2012

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers which decode the same set of messages. In this work, computation over multicast networks i ...

2012