Publications related to Kőnig's theorem (graph theory)

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Growing a Graph Matching from a Handful of Seeds

Matthias Grossglauser, Seyed Hamed Hassani, Ehsan Kazemi

In many graph–mining problems, two networks from different domains have to be matched. In the absence of reliable node attributes, graph matching has to rely on only the link structures of the two networks, which amounts to a generalization of the classic ...

Assoc Computing Machinery2015

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

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Michel Bierlaire, Bilal Farooq, Dimitrios Efthymiou, Paul Richard Anderson

The generation of synthetic populations through simulation methods is an important research topic and has a key application in agent-based modeling of transport and land use. The next step in this research area is the generation of complete synthetic house ...

Natl Acad Sciences2014

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Message-Passing Algorithms: Reparameterizations and Splittings

Nicholas Ruozzi

The max-product algorithm, a local message-passing scheme that attempts to compute the most probable assignment (MAP) of a given probability distribution, has been successfully employed as a method of approximate inference for applications arising in codin ...

Ieee-Inst Electrical Electronics Engineers Inc2013

On the Performance of Percolation Graph Matching

Matthias Grossglauser, Lyudmila Yartseva

Graph matching is a generalization of the classic graph isomorphism problem. By using only their structures a graph-matching algorithm finds a map between the vertex sets of two similar graphs. This has applications in the de-anonymization of social and in ...

ACM2013

Graph Matching for Adaptation in Remote Sensing

Devis Tuia

We present an adaptation algorithm focused on the description of the data changes under different acquisition conditions. When considering a source and a destination domain, the adaptation is carried out by transforming one data set to the other using an a ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Kőnig's theorem (graph theory)

Graph Chatbot

Chat with Graph Search

Growing a Graph Matching from a Handful of Seeds

The Erdos-Hajnal conjecture for rainbow triangles

Centrality of trees for capacitated -center

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Population Sensing Using Mobile Devices

Centrality of Trees for Capacitated k-Center

Message-Passing Algorithms: Reparameterizations and Splittings

On the Performance of Percolation Graph Matching

Microsimulation Framework for Urban Price-Taker Markets

Graph Matching for Adaptation in Remote Sensing

Centrality of trees for capacitated -center

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Microsimulation Framework for Urban Price-Taker Markets

Message-Passing Algorithms: Reparameterizations and Splittings

Population Sensing Using Mobile Devices

Growing a Graph Matching from a Handful of Seeds

The Erdos-Hajnal conjecture for rainbow triangles

Graph Matching for Adaptation in Remote Sensing

On the Performance of Percolation Graph Matching

Centrality of Trees for Capacitated k-Center