Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions (Q2203352): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict minimizers for geometric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence / rank
 
Normal rank

Latest revision as of 18:25, 23 July 2024

scientific article
Language Label Description Also known as
English
Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
scientific article

    Statements

    Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions (English)
    0 references
    6 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    energy minimization
    0 references
    pixel labeling
    0 references
    minimum cut
    0 references
    NP-hardness
    0 references
    0 references