Full characterization of a class of graphs tailored for software watermarking (Q2415367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Full characterization of a class of graphs tailored for software watermarking |
scientific article; zbMATH DE number 7057343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Full characterization of a class of graphs tailored for software watermarking |
scientific article; zbMATH DE number 7057343 |
Statements
Full characterization of a class of graphs tailored for software watermarking (English)
0 references
21 May 2019
0 references
linear-time algorithms
0 references
reducible permutation graphs
0 references
digital watermarking
0 references
software security
0 references
0 references
0.8866813778877258
0 references
0.8682664632797241
0 references
0.8549544811248779
0 references
0.8131691813468933
0 references
