On the resilience of canonical reducible permutation graphs

DOI10.1016/j.dam.2016.09.038zbMath1376.05064OpenAlexW2546960436MaRDI QIDQ1686046

Peng Zhang

Publication date: 20 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.038

zbMATH Keywords

linear-time algorithmssoftware securitygraph-based watermarkingreducible permutation graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data encryption (aspects in computer science) (68P25) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Full characterization of a class of graphs tailored for software watermarking

Cites Work

• Testing flow graph reducibility
• Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
• Full characterization of a class of graphs tailored for software watermarking
• Towards a Provably Resilient Scheme for Graph-Based Watermarking
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: On the resilience of canonical reducible permutation graphs