Publications associées à Chaîne (théorie des graphes)

Enhanced Matrix Completion with Manifold Learning

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

We study the problem of matrix completion when infor- mation about row or column proximities is available, in the form of weighted graphs. The problem can be formulated as the optimization of a convex function that can be solved efficiently using the alter ...

2015

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

Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames

Pierre Vandergheynst, David Shuman

We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While the filters used in previous spectral graph wavelet constructions ...

Institute of Electrical and Electronics Engineers2015

The Erdos-Hajnal conjecture for rainbow triangles

János Pach

We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order ohm(n(1/3) log(2) n) which uses at most two colors, and this bound is tight up to a constant factor. This verifies a conjectu ...

Academic Press Inc Elsevier Science2015

Saturated simple and k-simple topological graphs

János Pach, Jan Kyncl

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Designing laminated metal composites for tensile ductility

Andreas Mortensen, Amaël Maximilien Cohades, Arda Cetin

This contribution draws practical implications of a recently published estimation of the tensile ductility in laminated composites made of two ductile materials, typically metals or alloys, which harden as both the strain and the strain-rate increase. To t ...

Elsevier Sci Ltd2015

Destination Choice Model including panel data using WiFi localization in a pedestrian facility

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Antonin Danalet, Loïc Tinguely

This paper proposes a general methodology to model pedestrian destination choice from WiFi localization in multi-modal transport facilities (e.g., airports, railway stations). It is based on the output of Danalet et al.(2014) method to generate candidates ...

2015

Using Pareto optimality to explore the topology and dynamics of the human connectome

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

Graph theory has provided a key mathematical framework to analyse the architecture of human brain networks. This architecture embodies an inherently complex relationship between connection topology, the spatial arrangement of network elements, and the resu ...

Royal Soc2014

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.

Chaîne (théorie des graphes)

Enhanced Matrix Completion with Manifold Learning

A Precise Threshold For Quasi-Ramsey Numbers

Improving Christofides' Algorithm for the s-t Path TSP

Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames

The Erdos-Hajnal conjecture for rainbow triangles

Saturated simple and k-simple topological graphs

Designing laminated metal composites for tensile ductility

Destination Choice Model including panel data using WiFi localization in a pedestrian facility

Using Pareto optimality to explore the topology and dynamics of the human connectome

Exploring the Volumetric City. A Methodology for Investigating the Topology and Morphology of Surface and Subsurface Urban Spatial Networks

Graph Chatbot

Chattez avec Graph Search

The Erdos-Hajnal conjecture for rainbow triangles

Destination Choice Model including panel data using WiFi localization in a pedestrian facility

Enhanced Matrix Completion with Manifold Learning

Exploring the Volumetric City. A Methodology for Investigating the Topology and Morphology of Surface and Subsurface Urban Spatial Networks

Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames

Saturated simple and k-simple topological graphs

Designing laminated metal composites for tensile ductility

A Precise Threshold For Quasi-Ramsey Numbers

Improving Christofides' Algorithm for the s-t Path TSP

Using Pareto optimality to explore the topology and dynamics of the human connectome