Publications related to Forbidden graph characterization

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Mirjana Stojilovic, Guanglei Zhou

A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...

Los Alamitos2023

Dynamic control of high-voltage actuator arrays by light-pattern projection on photoconductive switches

Herbert Shea, Amir Firouzeh, Edouard Franck Vincent Gustave Leroy, Vesna Bacheva, Aiste Balciunaite

The ability to control high-voltage actuator arrays relies, to date, on expensive microelectronic processes or on individual wiring of each actuator to a single off-chip high-voltage switch. Here we present an alternative approach that uses on-chip photoco ...

SPRINGERNATURE2023

AiiDA-defects: an automated and fully reproducible workflow for the complete characterization of defect chemistry in functional materials

Nicola Marzari, Sokseiha Muy, Conrad Johnston

Functional materials that enable many technological applications in our everyday lives owe their unique properties to defects that are carefully engineered and incorporated into these materials during processing. However, optimizing and characterizing thes ...

IOP Publishing Ltd2023

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Akash Kumar

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

IEEE COMPUTER SOC2022

Superior visible light-mediated catalytic activity of a novel N-doped, Fe3O4-incorporating MgO nanosheet in presence of PMS: Imidacloprid degradation and implications on simultaneous bacterial inactivation

Stefanos Giannakis, Jérémie Decker

Impressive Imidacloprid (IMD) degradation and bacterial inactivation were attained through the photocatalytic activation of peroxymonosulfate (PMS) via a novel, N-doped MgO@Fe3O4, under visible light. After complete characterization (XPS, XRD, FT-IR, FE-SE ...

ELSEVIER2022

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Heterogeneity in decentralized asset markets

Julien Hugonnier

We study a canonical model of decentralized exchange for a durable good or asset, where agents are assumed to have time-varying, heterogeneous utility types. Whereas the existing literature has focused on the special case of two types, we allow agents' uti ...

ECONOMETRIC SOCIETY2022

Fast Lead-Free Humidity Sensor Based on Hybrid Halide Perovskite

László Forró, Dragan Damjanovic, Endre Horvath, Alla Arakcheeva, Márton Kollár, Pavao Roko Andricevic, Trpimir Ivsic

An environmentally friendly analog of the prominent methylammonium lead halide perovskite, methylammonium bismuth bromide (MA3Bi2Br9), was prepared and investigated in the form of powder, single crystals and nanowires. Complete characterization via synchro ...

2022

Plunging Circular Jets: Experimental Characterization of Dynamic Pressures Near the Stagnation Zone

Giovanni De Cesare, Pedro Filipe De Almeida Manso, Gregoire Aurelien Marie Jamet

Spillways are a requirement for dams’ safety, mainly preventing overtopping during floods. A common spillway solution involves plunging jets, which dissipate a considerable flow energy in the plunge pool. Energy dissipation has to occur in a controlled man ...

2022

Multilayer Graph Clustering With Optimized Node Embedding

Pascal Frossard, Mireille El Gheche

We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem that involves a fid ...

IEEE2021

Atomic subgraphs and the statistical mechanics of networks

Sofia Charlotta Olhede

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...

2021

Examples of normal, not geometrically normal, projective Gorenstein del Pezzo surfaces with at most Du Val singularities

Ursina Schweizer

While over fields of characteristic at least 5, a normal, projective and Gorenstein del Pezzo surface is geometrically normal, this does not hold for characteristic 2 and 3. There is no characterization of all such non-geometrically normal surfaces, but th ...

EPFL2021

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

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

Graph Learning with Partial Observations: Role of Degree Concentration

Ali H. Sayed, Augusto José Rabelo Almeida Santos

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, Junqiu Liu, Erwan Guillaume Albert Lucas, Arslan Sajid Raja, Guanhao Huang, 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

Ordered Graphs And Large Bi-Cliques In Intersection Graphs Of Curves

János Pach, Istvan Tomon

An ordered graph G(

COMENIUS UNIV2019