Search results
From MaRDI portal
- Publication Type Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions 2023-10-23 Paper Minimum Cut and Minimum k-Cut in Hypergraphs via...10 bytes (16 words) - 22:28, 27 December 2023
- Type An I/O Efficient Algorithm for Minimum Spanning Trees 2016-02-05 Paper I/O efficient algorithms for the minimum cut problem on unweighted undirected...10 bytes (16 words) - 19:15, 6 October 2023
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms 1996-07-07 Paper...10 bytes (16 words) - 22:06, 24 September 2023
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms 1996-07-07 Paper...10 bytes (16 words) - 22:06, 24 September 2023
- Branch-and-Reduce for Multiterminal Cuts 2021-01-27 Paper https://portal.mardi4nfdi.de/entity/Q5140710 2020-12-16 Paper Practical Minimum Cut Algorithms 2019-09-12 Paper...10 bytes (16 words) - 14:31, 6 October 2023
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms 1996-07-07 Paper FINDING k FARTHEST PAIRS...10 bytes (16 words) - 18:03, 6 October 2023
- Fully-Dynamic Cut Tree Construction 2013-03-21 Paper Cubic Augmentation of Planar Graphs 2013-03-21 Paper Dynamic Graph Clustering Using Minimum-Cut Trees 2012-12-04...10 bytes (16 words) - 11:25, 6 October 2023
- probe 2020-10-23 Paper Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions 2019-10-15 Paper Holiest minimum-cost paths and flows in...10 bytes (16 words) - 05:33, 7 October 2023
- 2022-08-16 Paper On minimum reload cost cycle cover 2015-09-22 Paper On Minimum Reload Cost Cycle Cover 2012-05-13 Paper Approximating Minimum Cut with Bounded...10 bytes (17 words) - 04:03, 12 December 2023
- strongly polynomial cut cancelling algorithms for minimum cost network flow 1994-01-02 Paper Canceling most helpful total cuts for minimum cost network flow...10 bytes (19 words) - 11:24, 8 December 2023
- 2013-01-10 Paper On Minimum Reload Cost Cycle Cover 2012-05-13 Paper On minimum reload cost paths, tours, and flows 2011-06-22 Paper On Minimum Changeover Cost...10 bytes (16 words) - 04:03, 12 December 2023
- algorithms for minimum tree cut/paste distance and minimum common integer partition 2020-07-07 Paper Fixed-parameter tractability for minimum tree cut/paste distance...10 bytes (16 words) - 06:02, 7 October 2023
- graph theory 1982-01-01 Paper Selected Applications of Minimum Cuts in Networks 1982-01-01 Paper A cut approach to a class of quadratic integer programming...10 bytes (18 words) - 10:33, 7 October 2023
- parametric global minimum cuts in graphs and hypergraphs 2015-12-09 Paper A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts 2014-06-02...10 bytes (16 words) - 10:25, 7 October 2023
- Type New algorithms for the minimum coloring cut problem 2023-11-16 Paper A polyhedral approach to the generalized minimum labeling spanning tree problem...10 bytes (20 words) - 14:23, 28 January 2024
- graphs 2022-04-27 Paper Solving the minimum convex partition of point sets with integer programming 2021-12-15 Paper Minimum convex partition of point sets...10 bytes (20 words) - 07:13, 9 December 2023
- transshipments: a branch-and-cut solution approach 2021-06-03 Paper Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm 2018-11-19 Paper...10 bytes (20 words) - 02:00, 11 December 2023
- Generalized Multiway Cut in Trees Problem 2012-11-02 Paper On Editing Graphs into 2-Club Clusters 2012-07-16 Paper Approximating Minimum Label s-t Cut via Linear...10 bytes (17 words) - 00:45, 11 December 2023
- Type Minimum label \(s\)-\(t\) cut has large integrality gaps 2020-12-15 Paper Simpler and better approximation algorithms for the unweighted minimum label...10 bytes (17 words) - 14:54, 12 December 2023
- constrained minimum spanning tree problem 2016-04-04 Paper The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm...10 bytes (20 words) - 00:18, 10 December 2023
