Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
From MaRDI portal
Publication:2203352
DOI10.1007/s10851-020-00963-8zbMath1482.68180OpenAlexW3034438970MaRDI QIDQ2203352
Filip Malmberg, Krzysztof Chris Ciesielski
Publication date: 6 October 2020
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-020-00963-8
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Toward a sparsity theory on weighted lattices, Efficient hierarchical multi-object segmentation in layered graphs
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
- Strict minimizers for geometric optimization
- Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence
- Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision