output
20172025
most citedAn Evaluation Tool for Backbone Extraction Techniques in Weighted Complex Networks

28 citations

Showing 2024Show all

5 papers · 1 filter

cs.DC2024

Renaming in distributed certification

Nicolas Bousquet, Louis Esperet, Laurent Feuilloley +1

Local certification is the area of distributed network computing asking the following question: How to certify to the nodes of a network that a global property holds, if they are l…

math.CO2024

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles

Kyle Burke, Antoine Dailly, Nacim Oijid

Arc-Kayles is a game where two players alternate removing two adjacent vertices until no move is left, the winner being the player who played the last move. Introduced in 1978, its…

quant-ph2024★ 1 cited

Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way

Samuel Bouaziz--Ermann, Garazi Muguruza

Pseudorandom Quantum States (PRS) were introduced by Ji, Liu and Song as quantum analogous to Pseudorandom Generators. They are an ensemble of states efficiently computable but com…

math.CO2024★ 9 cited

The Maker-Breaker Largest Connected Subgraph Game

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney +2

Given a graph and , we introduce the following game played in . Each round, Alice colours an uncoloured vertex of red, and then Bob colours one blue (i…

cs.DM2024

Fast winning strategies for the attacker in eternal domination

Guillaume Bagan, Nicolas Bousquet, Nacim Oijid +1

Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurrin…