Dynamic connectivity in digital images (Q290227): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to connected-component labeling for arbitrary image representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator based sparsification for dynamic planar graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of a minimum spanning forest in a dynamic plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for fully dynamic connectivity problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved data structures for fully dynamic biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039959 / rank
 
Normal rank

Latest revision as of 02:57, 12 July 2024

scientific article
Language Label Description Also known as
English
Dynamic connectivity in digital images
scientific article

    Statements

    Dynamic connectivity in digital images (English)
    0 references
    0 references
    1 June 2016
    0 references
    computational complexity
    0 references
    dynamic planar connectivity
    0 references
    percolation
    0 references
    lower bounds
    0 references
    image processing
    0 references
    computer Go
    0 references
    lines of action
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references