Publications associées à Algebraic techniques for deterministic networks

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.

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Learning time varying graphs

Pascal Frossard, Andreas Loukas, Vasilis Kalofolias

We consider the problem of inferring the hidden structure of high-dimensional dynamic systems from the perspective of graph learning. In particular, we aim at capturing the dynamic relationships between nodes by a sequence of graphs. Our approach is motiva ...

Ieee2017

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Pierre Vandergheynst, Kirell Maël Benzi, Benjamin Ricaud

Graphs are now ubiquitous in almost every field of research. Recently, new research areas devoted to the analysis of graphs and data associated to their vertices have emerged. Focusing on dynamical processes, we propose a fast, robust and scalable framewor ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Curve Graphs On Surfaces Of Infinite Type

Hugo Parlier, Ariadna Fossas Tenas

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense. We show that the ...

Suomalainen Tiedeakatemia2015

Free-Shape Polygonal Object Localization

Pascal Fua, Christos Marios Christoudias, Xiaolu Sun

Polygonal objects are prevalent in man-made scenes. Early approaches to detecting them relied mainly on geometry while subsequent ones also incorporated appearance-based cues. It has recently been shown that this could be done fast by searching for cycles ...

Springer-Verlag Berlin2014

Approximations for Stochastic Graph Rewriting

Sandro Stucki

In this note we present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects, and jumps must be de ...

Springer International Publishing2014

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Algebraic techniques for deterministic networks

Graph Chatbot

Chattez avec Graph Search

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Generalized Turan Problems For Even Cycles

Learning time varying graphs

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Curve Graphs On Surfaces Of Infinite Type

Free-Shape Polygonal Object Localization

Approximations for Stochastic Graph Rewriting

Lower bounds on the obstacle number of graphs

Generalized Turan Problems For Even Cycles

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Learning time varying graphs

Curve Graphs On Surfaces Of Infinite Type

Approximations for Stochastic Graph Rewriting

Independence number of generalized Petersen graphs

Lower bounds on the obstacle number of graphs

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Free-Shape Polygonal Object Localization

Scaling a Reliable Distributed System