New secure partial encryption method for medical images using graph coloring problem (Q330803): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q121186063, #quickstatements; #temporary_batch_1712101902020
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3420741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906054 / rank
 
Normal rank

Latest revision as of 20:05, 12 July 2024

scientific article
Language Label Description Also known as
English
New secure partial encryption method for medical images using graph coloring problem
scientific article

    Statements

    New secure partial encryption method for medical images using graph coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2016
    0 references
    medical imaging
    0 references
    encryption
    0 references
    decryption
    0 references
    partial encryption
    0 references
    histogram
    0 references
    AES
    0 references
    graph coloring problem
    0 references
    heuristic local search
    0 references

    Identifiers