Concept

Largeur de clique

Publications associées (27)

The micro-world of cographs

Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the world of ...

ELSEVIER2022

Figlearn: Filter And Graph Learning Using Optimal Transport

Pascal Frossard, Mireille El Gheche, Matthias Minder, Zahra Farsijani

In many applications, a dataset can be considered as a set of observed signals that live on an unknown underlying graph structure. Some of these signals may be seen as white noise that has been filtered on the graph topology by a graph filter. Hence, the k ...

IEEE2021

Distributed Coloring of Graphs with an Optimal Number of Colors

Etienne Michel François Bamas

This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on ...

SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS2019

Uncertainty Quantification of geochemical and mechanical compaction in layered sedimentary basins

Fabio Nobile, Lorenzo Tamellini, Anna Scotti

In this work we propose an Uncertainty Quantification methodology for sedimentary basins evolution under mechanical and geochemical compaction processes, which we model as a coupled, time-dependent, non-linear, monodimensional (depth-only) system of PDEs w ...

Elsevier2018

Search for a new scalar resonance decaying to a pair of Z bosons in proton-proton collisions at $\sqrt{s}=13 $ TeV

Jian Wang, Matthias Finger, Lesya Shchutska, Qian Wang, Matthias Wolf, Varun Sharma, Konstantin Androsov, Jan Steggemann, Leonardo Cristella, Roberto Castello, Alessandro Degano, Xin Chen, Davide Di Croce, Mingkui Wang, Zhirui Xu, Chao Wang, João Miguel das Neves Duarte, Tagir Aushev, Tian Cheng, Yixing Chen, Werner Lustermann, Andromachi Tsirou, Alexis Kalogeropoulos, Andrea Rizzi, Ioannis Papadopoulos, Paolo Ronchese, Thomas Muller, Ho Ling Li, Giuseppe Codispoti, Hua Zhang, Siyuan Wang, Peter Hansen, Daniel Gonzalez, Tao Huang, David Vannerom, Michele Bianco, Kun Shi, Wei Shi, Abhisek Datta, Ji Hyun Kim, Donghyun Kim, Dipanwita Dutta, Zheng Wang, Sanjeev Kumar, Wei Li, Yong Yang, Yi Wang, Ajay Kumar, Ashish Sharma, Georgios Anagnostou, Joao Varela, Csaba Hajdu, Muhammad Ahmad, Ekaterina Kuznetsova, Ioannis Evangelou, Matthias Weber, Muhammad Shoaib, Milos Dordevic, Vineet Kumar, Vladimir Petrov, Francesco Fiori, Quentin Python, Meng Xiao, Hao Liu, Viktor Khristenko, Marco Trovato, Gurpreet Singh, Fan Xia, Kai Yi, Bibhuprasad Mahakud, Jing Li, Rajat Gupta, Lei Feng, Muhammad Waqas, Shuai Liu, Hui Wang, Seungkyu Ha, Davide Cieri, Maren Tabea Meinhard, Giorgia Rauco, Aram Avetisyan, Ali Harb, Benjamin William Allen, Pratyush Das, Miao Hu, Wenjing Wu

A search for a new scalar resonance decaying to a pair of Z bosons is performed in the mass range from 130 GeV to 3 TeV, and for various width scenarios. The analysis is based on proton-proton collisions recorded by the CMS experiment at the LHC in 2016, c ...

2018

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to depend on standard ...

2018

An Adaptive Sublinear-Time Block Sparse Fourier Transform

Volkan Cevher, Mikhail Kapralov, Jonathan Mark Scarlett, Amir Zandieh

The problem of approximately computing the

k

dominant Fourier coefficients of a vector

X

quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in ...

2017

The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction ...

Springer-Verlag Berlin2014

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Bartosz Maria Walczak, Michal Lason

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of com ...

Springer2014

In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free fam ...

Academic Press Inc Elsevier Science2014

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