Zobrazeno 1 - 10
of 218
pro vyhledávání: '"Perez, Anthony"'
Autor:
Houle, Michael, Jones, Michael, Wallmeyer, Dan, Brodeur, Risa, Burr, Justin, Jananthan, Hayden, Merrell, Sam, Michaleas, Peter, Perez, Anthony, Prout, Andrew, Kepner, Jeremy
Hypersparse traffic matrices constructed from network packet source and destination addresses is a powerful tool for gaining insights into network traffic. SuiteSparse: GraphBLAS, an open source package or building, manipulating, and analyzing large
Externí odkaz:
http://arxiv.org/abs/2409.12297
Autor:
Dallard, Clément, Dumas, Maël, Hilaire, Claire, Milanič, Martin, Perez, Anthony, Trotignon, Nicolas
We consider a natural generalization of chordal graphs, in which every minimal separator induces a subgraph with independence number at most $2$. Such graphs can be equivalently defined as graphs that do not contain the complete bipartite graph $K_{2
Externí odkaz:
http://arxiv.org/abs/2402.08332
Autor:
Perez, Anthony
Community detection is a powerful tool from complex networks analysis that finds applications in various research areas. Several image segmentation methods rely for instance on community detection algorithms as a black box in order to compute underse
Externí odkaz:
http://arxiv.org/abs/2308.14101
Autor:
Dumas, Maël, Perez, Anthony
In the Trivially Perfect Editing problem one is given an undirected graph $G = (V,E)$ and an integer $k$ and seeks to add or delete at most $k$ edges in $G$ to obtain a trivially perfect graph. In a recent work, Dumas, Perez and Todinca [Algorithmica
Externí odkaz:
http://arxiv.org/abs/2306.16899
The transport of aerosol discharge in the form of a passive scalar or tracer discharged from a single cough of a patient in a ventilated mock hospital isolation room is investigated via computational fluid dynamics (CFD). Healthcare worker (HCW) expo
Externí odkaz:
http://arxiv.org/abs/2304.10496
We show that if the edges or vertices of an undirected graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is upper-bounded by a single-exponential function of $k$. As a corollary, we prove that the problem Isometric Path Cover
Externí odkaz:
http://arxiv.org/abs/2206.15088
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block grap
Externí odkaz:
http://arxiv.org/abs/2201.13140
We consider the Trivially Perfect Editing problem, where one is given an undirected graph $G = (V,E)$ and a parameter $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a trivially perfect graph. The related Tri
Externí odkaz:
http://arxiv.org/abs/2105.08549
Publikováno v:
Algorithmica 83(9):2651-2677, 2021
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph $D$ is a function $f:V(D)\to\mathbb{N}$ such that for each vertex $v$ of $D$,
Externí odkaz:
http://arxiv.org/abs/2003.10570
Autor:
Perez, Anthony L.
Existen muchos estudios sobre la musica latina en general y sobre la salsa en particular. Muchos paises latinoamericanos han contribuido con diferentes ritmos e instrumentos para construir lo que hoy denominare el ritmo salsa. No obstante, hay pocos