Publications associées à Couplage (théorie des graphes)

Truly abstract interfaces for algebraic data types: the extractor typing problem

Martin Odersky, Nicolas Alexander Stucki, Paolo Giosuè Giarrusso

Pattern matching enables inspecting algebraic data types, but typically prevents hiding the implementation of the matched algebraic data type. In Scala, instead, extractors also allow pattern matching on non-algebraic data types and invoking methods on the ...

2018

Spin-liquid behaviour and the interplay between Pokrovsky-Talapov and Ising criticality in the distorted, triangular-lattice, dipolar Ising antiferromagnet

Frédéric Mila, Andrew James Smerald

We study the triangular-lattice Ising model with dipolar interactions, inspired by its realisation in artificial arrays of nanomagnets. We show that a classical spin-liquid forms at intermediate temperatures, and that its behaviour can be tuned by temperat ...

2018

Geometric Graph Matching Using Monte Carlo Tree Search

Pascal Fua, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imagi ...

Ieee Computer Soc2017

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Bernard Moret, Mingfu Shao

A fundamental problem in comparative genomics is to compute the distance between two genomes in terms of its higher level organization (given by genes or syntenic blocks). For two genomes without duplicate genes, we can easily define (and almost always eff ...

Mary Ann Liebert, Inc2017

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

Bartering Books to Beers: a Recommender System for Exchange Platforms

Michele Catasta, Jérémie Rappaz, Maria-Luiza Vladarean

Bartering is a timeless practice that is becoming increasingly popular on the Web. Recommending trades for an online bartering platform shares many similarities with traditional approaches to recommendation, in particular the need to model the preferences ...

2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Stationary signal processing on graphs

Pierre Vandergheynst, Nathanaël Perraudin

Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or network ...

Institute of Electrical and Electronics Engineers2017

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.

Couplage (théorie des graphes)

Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

Truly abstract interfaces for algebraic data types: the extractor typing problem

Spin-liquid behaviour and the interplay between Pokrovsky-Talapov and Ising criticality in the distorted, triangular-lattice, dipolar Ising antiferromagnet

Geometric Graph Matching Using Monte Carlo Tree Search

The weighted stable matching problem

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Extension complexity of stable set polytopes of bipartite graphs

Bartering Books to Beers: a Recommender System for Exchange Platforms

A semi-algebraic version of Zarankiewicz's problem

Stationary signal processing on graphs

Graph Chatbot

Chattez avec Graph Search

Geometric Graph Matching Using Monte Carlo Tree Search

Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

Stationary signal processing on graphs

A semi-algebraic version of Zarankiewicz's problem

Extension complexity of stable set polytopes of bipartite graphs

Bartering Books to Beers: a Recommender System for Exchange Platforms

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Spin-liquid behaviour and the interplay between Pokrovsky-Talapov and Ising criticality in the distorted, triangular-lattice, dipolar Ising antiferromagnet

The weighted stable matching problem

Truly abstract interfaces for algebraic data types: the extractor typing problem