Jan 10, 2018 · We introduce a linear-time algorithm which restores the original graph after removals of edges, therefore proving an even stronger result.

Abstract. An ingenious graph-based watermarking scheme recently proposed by Chroni and Nikolopoulos encodes integers as a special type of reducible permuta-.

Oct 22, 2024 · The ingenious graph-based software watermarking scheme presented recently by Chroni and Nikolopoulos encodes integers as canonical reducible ...

This property causes a codec watermarking system resilient to attacks since we can embed multiple copies of the same watermark value w into an application ...

A formal characterization of the class of graphs generated by their encoding function, which is called canonical reducible permutation graphs, is given, ...

On the resilience of canonical reducible permutation graphs. LMS Bento, DR Boccardo, RCS Machado, VGP de Sá, JL Szwarcfiter. Discrete Applied Mathematics 234 ...

3 Canonical reducible permutation graphs. This section is devoted to the characterization of the class of canonical reducible permutation. graphs. After ...

On the resilience of canonical reducible permutation graphs. LMS Bento, DR Boccardo, RCS Machado, VGP de Sá, JL Szwarcfiter. Discrete Applied Mathematics ...

the resilience of canonical reducible permutation graphs. Discrete Applied Mathematics 234,. 32–46, 2016. [2] M. Chroni and S.D. Nikolopoulos. Encoding ...

Jan 10, 2018 · On the resilience of canonical reducible permutation graphs. Lucila M.S. Bento, Davidson R. Boccardo, Raphael C.S. Machado, Vinícius G ...