Publications associées à Graph Transformations preserving the stability number

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.

Chaos: Scale-out Graph Processing from Secondary Storage

Willy Zwaenepoel, Laurent Bindschaedler, Amitabha Roy, Jasmina Malicevic

Chaos scales graph processing from secondary storage to multiple machines in a cluster. Earlier systems that process graphs from secondary storage are restricted to a single ma- chine, and therefore limited by the bandwidth and capacity of the storage syst ...

2015

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...

2015

Robust Principal Component Analysis on Graphs

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Nauman Shahid, Vasilis Kalofolias

Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA solves the first iss ...

2015

Moment Semantics for Reversible Rule-Based Systems

Sandro Stucki

We develop a notion of stochastic rewriting over marked graphs – i.e. directed multigraphs with degree constraints. The approach is based on double-pushout (DPO) graph rewriting. Marked graphs are expressive enough to internalize the ‘no-dangling-edge’ con ...

Springer International Publishing2015

Detecting nanoscale vibrations as signature of life

Giovanni Dietler, Sandor Kasas, Giovanni Longo, Francesco Simone Ruggeri, Petar Stupar

The existence of life in extreme conditions, in particular in extraterrestrial environments, is certainly one of the most intriguing scientific questions of our time. In this report, we demonstrate the use of an innovative nanoscale motion sensor in life-s ...

National Academy of Sciences2015

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

Two notions of unit distance graphs

Andrei Kupavskii

A faithful (unit) distance graph in R-d is a graph whose set of vertices is a finite subset of the d-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is exactly 1. A (unit) distance graph in Rd ...

Academic Press Inc Elsevier Science2014

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

Graph Transformations preserving the stability number

Graph Chatbot

Chattez avec Graph Search

Chaos: Scale-out Graph Processing from Secondary Storage

Clustered planarity testing revisited

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

Robust Principal Component Analysis on Graphs

Moment Semantics for Reversible Rule-Based Systems

Detecting nanoscale vibrations as signature of life

Approximations for Stochastic Graph Rewriting

Two notions of unit distance graphs

Free-Shape Polygonal Object Localization

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Free-Shape Polygonal Object Localization

Reconstruction of Images from Gabor Graphs with Applications in Facial Image Processing

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Chaos: Scale-out Graph Processing from Secondary Storage

Clustered planarity testing revisited

Detecting nanoscale vibrations as signature of life

Robust Principal Component Analysis on Graphs

Moment Semantics for Reversible Rule-Based Systems

Approximations for Stochastic Graph Rewriting

Two notions of unit distance graphs