Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929): Difference between revisions

@@ Property / author @@
-Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
-Normal rank
@@ Property / author @@
+Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient computation of tolerances in the weighted independent set problem for trees
+Normal rank
@@ Property / cites work @@
+A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
+Normal rank
@@ Property / cites work @@
+Lower tolerance-based branch and bound algorithms for the ATSP
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
+Normal rank
@@ Property / cites work @@
+Arc tolerances in shortest path and network flow problems
+Normal rank
@@ Property / cites work @@
+An addendum on: ``Sensitivity analysis of the optimal assignment''
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:461929