activity
20182024
most citedOn random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

3 citations · 3 across the 6 of their papers we have counts for

collaborators

8 papers

cs.DB2024

Chase Anonymisation: Privacy-Preserving Knowledge Graphs with Logical Reasoning

Luigi Bellomarini, Costanza Catalano, Andrea Coletta +2

We propose a novel framework to enable Knowledge Graphs (KGs) sharing while ensuring that information that should remain private is not directly released nor indirectly exposed via…

cs.DS2023

On Computing Optimal Temporal Branchings and Spanning Subgraphs

Daniela Bubboloni, Costanza Catalano, Andrea Marino +1

In this work we extend the concept of out/in-branchings spanning the vertices of a digraph (also called directed spanning trees) to temporal graphs, which are digraphs where arcs a…

cs.SI2022

On a Network Centrality Maximization Game

Costanza Catalano, Maria Castaldo, Giacomo Como +1

We study a network formation game where players, identified with the nodes of a directed graph to be formed, choose where to wire their outgoing links in order to maximize thei…

cs.SI2019

On a Centrality Maximization Game

Maria Castaldo, Costanza Catalano, Giacomo Como +1

The Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google's PageRank algorithm. In this p…

cs.DM2019

A linear bound on the k-rendezvous time for primitive sets of NZ matrices

Costanza Catalano, Umer Azfar, Ludovic Charlier +1

A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automat…

cs.FL2018★ 3 cited

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

Costanza Catalano, Raphaël M. Jungers

We tackle the problem of the randomized generation of slowly synchronizing deterministic automata (DFAs) by generating random primitive sets of matrices. We show that when the rand…

cs.FL2018

On randomized generation of slowly synchronizing automata

Costanza Catalano, Raphaël M. Jungers

Motivated by the randomized generation of slowly synchronizing automata, we study automata made of permutation letters and a merging letter of rank . We present a constr…

cs.FL2018

The Synchronizing Probability Function for Primitive Sets of Matrices

Costanza Catalano, Raphaël M. Jungers

Motivated by recent results relating synchronizing DFAs and primitive sets, we tackle the synchronization process and the related longstanding Černý conjecture by studying the prim…