Concept

Forbidden graph characterization

Publications associées (71)

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

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study the problem of localizing a configuration of points and planes from the collection of point-to-plane distances. This problem models simultaneous localization and mapping from acoustic echoes as well as the & x201C;structure from sound & x201D; app ...

2020

Size distribution of aerosol particles between 2.5 and 920 nm measured during the Arctic Ocean 2018 expedition

Julia Schmale, Andrea Baccarini

The aerosol size distribution was obtained combining measurements from a neutral and air ion spectrometer (NAIS) with a differential mobility particle sizer (DMPS). Merging particle size distribution (PSD) measurements from different instruments allows to ...

2020

New approach for time-resolved and dynamic investigations on nanoparticles agglomeration

Francesco Stellacci, Antonia Neels, Alex Dommann, Urszula Beata Cendrowska, Claudio Toncelli

Nanoparticle (NP) colloidal stability plays a crucial role in biomedical application not only for human and environmental safety but also for NP efficiency and functionality. NP agglomeration is considered as a possible process in monodispersed NP colloida ...

TSINGHUA UNIV PRESS2020

In this work we consider the problem of learning an Erdos-Renyi graph over a diffusion network when: i) data from only a limited subset of nodes are available (partial observation); ii) and the inferential goal is to discover the graph of interconnections ...

IEEE2019

Time-resolved analysis of dynamic graphs: an extended Slepian design

Dimitri Nestor Alice Van De Ville, Raphaël Pierre Liégeois, Ibrahim Merad

Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allow ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Thermo-refractive noise in silicon nitride microresonators

Tobias Kippenberg, Guanhao Huang, Junqiu Liu, Erwan Guillaume Albert Lucas, Arslan Sajid Raja, Nils Johan Engelsen

Thermodynamic noises limit the frequency stability of resonators. Here, we present the first complete characterization of thermo-refractive noise in Si3N4 microresonators. The measurements are in good agreement with theoretical analysis and FEM simulation ...

IEEE2019

Edge Ordered Turan Problems

Gábor Tardos, Abhishek Methuku

We introduce the Turan problem for edge ordered graphs. We call a simple graph edge ordered, if its edges are linearly ordered. An isomorphism between edge ordered graphs must respect the edge order. A subgraph of an edge ordered graph is itself an edge or ...

COMENIUS UNIV2019

The Sketching Complexity of Graph and Hypergraph Counting

Mikhail Kapralov, John Michael Goddard Kallaugher

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been ...

IEEE COMPUTER SOC2018

The weighted stable matching problem

Linda Farczadi

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general ...

2017