Maximal Independent Sets for the Pixel Expansion of Graph Access Structure
Clicks: 358
ID: 23403
2008
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
67.2
/100
358 views
236 readers
Trending
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #7 of 34 articles by views in international journal of industrial engineering and production research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was applied to propose a lower bound on the pixel expansion of visual cryptography schemes with graph access structure (G ). In addition a lower bound on the pixel expansion of basis matrices C5 and Peterson graph access structure were presented .
| Reference Key |
dehkordi2008maximalinternational
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Dehkordi, M. Hadian;Cheraghi, A.; |
| Journal | international journal of industrial engineering and production research |
| Year | 2008 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.