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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10851-020-00963-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3034438970
@@ Property / OpenAlex ID: W3034438970 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Strict minimizers for geometric optimization
@@ Property / cites work: Strict minimizers for geometric optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision
+Normal rank
@@ Property / cites work @@
+Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence
+Normal rank