A Note on the Parallel Cleaning of Cliques
Combinatorics
2020-01-01 v1
Abstract
We disprove a conjecture proposed in [Gaspers et al., Discrete Applied Mathematics, 2010] and provide a new upper bound for the minimum number of brushes required to continually parallel clean a clique.
Cite
@article{arxiv.1912.12992,
title = {A Note on the Parallel Cleaning of Cliques},
author = {Alejandro Angeli Ayello and Margaret-Ellen Messinger},
journal= {arXiv preprint arXiv:1912.12992},
year = {2020}
}
Related papers
View all related →
Combinatorics · Mathematics
Analysis of the parallel peeling algorithm: a short proof
Pu Gao
2014-03-03
Data Structures and Algorithms · Computer Science
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Ciaran McCreesh, Patrick Prosser
2014-11-18
Combinatorics · Mathematics
Regarding two conjectures on clique and biclique partitions
Dhruv Rohatgi, John C. Urschel, Jake Wellens
2020-05-07
Data Structures and Algorithms · Computer Science
Parallel Clique Counting and Peeling Algorithms
Jessica Shi, Laxman Dhulipala, Julian Shun
2021-07-19
Distributed, Parallel, and Cluster Computing · Computer Science
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
2014-09-05
Combinatorics · Mathematics
The Pebbling Threshold of the Square of Cliques
Airat Bekmetjev, Glenn Hurlbert
2009-09-29
Combinatorics · Mathematics
Clique covers of H-free graphs
Tung Nguyen, Alex Scott, Paul Seymour, Stephan Thomasse
2022-11-23
Data Structures and Algorithms · Computer Science
Incremental Maintenance of Maximal Cliques in a Dynamic Graph
Apurba Das, Michael Svendsen, Srikanta Tirthapura
2018-03-20
Combinatorics · Mathematics
Maximizing the number of vertices of an N-clique cover of the edges of a graph on N vertices
Leopoldo Taravilse
2017-03-09
Data Structures and Algorithms · Computer Science
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler
2021-09-21
Distributed, Parallel, and Cluster Computing · Computer Science
Theoretically and Practically Efficient Parallel Nucleus Decomposition
Jessica Shi, Laxman Dhulipala, Julian Shun
2022-08-12
Discrete Mathematics · Computer Science
Cover Combinatorial Filters and their Minimization Problem (Extended Version)
Yulin Zhang, Dylan A. Shell
2022-02-01
Computational Geometry · Computer Science
Minimum Ply Covering of Points with Unit Squares
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
2022-08-15
Artificial Intelligence · Computer Science
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
Brijnesh Jain, Klaus Obermayer
2009-12-24
Combinatorics · Mathematics
On Cliques and Lagrangians of 3-uniform Hypergraphs
Yuejian Peng, Hegui Zhu, Yanling Zheng, Cheng Zhao
2014-04-03
Databases · Computer Science
Efficiently Finding a Maximal Clique Summary via Effective Sampling
Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu +2
2020-12-01
Discrete Mathematics · Computer Science
An Important Corollary for the Fast Solution of Dynamic Maximal Clique Enumeration Problems
Neal Lawton
2014-12-17
Logic · Mathematics
A minimal pair in the generic degrees
Denis R. Hirschfeldt
2020-04-22
Distributed, Parallel, and Cluster Computing · Computer Science
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
François Le Gall
2021-10-05
Data Structures and Algorithms · Computer Science
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt
2024-04-26
Data Structures and Algorithms · Computer Science
A Note on Improved Results for One Round Distributed Clique Listing
Quanquan C. Liu
2022-12-27
Discrete Mathematics · Computer Science
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
S. Nikoletseas, C. Raptopoulos, P. G. Spirakis
2012-04-19
Combinatorics · Mathematics
Pure Simplicial and Clique Complexes with a Fixed Number of Facets
Kassahun H Betre, Yan X Zhang, Carter Edmond
2024-11-21
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2014-12-01
Combinatorics · Mathematics
Clique covers and decompositions of cliques of graphs
József Balogh, Jialin He, Robert A. Krueger, The Nguyen +1
2024-12-24