Concept

Sommet (théorie des graphes)

Publications associées (183)

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

Chebyshev polynomial approximation for transductive learning on graphs

Nathanaël Perraudin

The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...

2011

Minimum clique partition in unit disk graphs

János Pach

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and edges connecting poi ...

Springer Verlag2011

Conway's conjecture for monotone thrackles

János Pach

A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway's conjecture, every thrackle has at most as many edges as vertices. We prove this conj ...

Mathematical Association of America2011

Disjoint homometric sets in graphs

János Pach

Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let h(n) denote the largest number h such that any connected graph of n vertices contains two disjoint homometric subsets of size h. It ...

2011

A computational approach to Conway's thrackle conjecture

János Pach, Radoslav Fulek

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have. According to a 40 yea ...

2011

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...

2011

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Jan Kyncl

A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chai ...

2011

Chaotic mixing using source-sink microfluidic flows in a PDMS chip

Martinus Gijs, Abdeljalil Sayah, Caroline Vandevyver, Hüseyin Cumhur Tekin, Ata Tuna Ciftlik, Venkataragavalu Sivagnanam

We present an active fixed-volume mixer based on the creation of multiple source–sink microfluidic flows in a polydimethylsiloxane (PDMS) chip without the need of external or internal pumps. To do so, four different pressure-controlled actuation chambers a ...

Springer-Verlag2011

Local Graph-based Distributed Control for Safe Highway Platooning

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of vehicles, endowed with local positioning capabilities (range and bearing to other vehicles), can keep a predefined formation. We propose a longitudinal and lateral controller that stabilizes a syst ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leader- following mission whilst keeping a predefined configuration. The possibility to locally cha ...

IEEE2010