Search results
From MaRDI portal
- de/entity/Q5136223 2020-11-25 Paper External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs 2020-10-21 Paper Cascade heap: towards time-optimal...10 bytes (18 words) - 22:42, 10 December 2023
- complementarity constraints 2021-08-11 Paper Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling 2020-10-26 Paper On cutting...10 bytes (21 words) - 02:07, 11 December 2023
- Paper Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth 2015-01-13 Paper Length-bounded cuts and flows 2014-09-09 Paper Broadcast...10 bytes (17 words) - 16:41, 6 December 2023
- increase the node-connectivity of a digraph by one 2008-11-19 Paper A note on degree-constrained subgraphs 2008-05-13 Paper An algorithm for node-capacitated...10 bytes (17 words) - 15:05, 9 December 2023
- 1997-10-05 Paper An $o(n^3 )$-Time Maximum-Flow Algorithm 1997-06-09 Paper Hypercubes and Multicommodity Flows 1997-05-26 Paper https://portal.mardi4nfdi...10 bytes (16 words) - 05:56, 9 December 2023
- 2011-04-27 Paper Node-Capacitated Ring Routing 2005-11-11 Paper Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related...10 bytes (16 words) - 21:59, 24 September 2023
- and facet algorithms for node flow polyhedra 2010-09-16 Paper https://portal.mardi4nfdi.de/entity/Q3584085 2010-08-18 Paper Flows with unit path capacities...10 bytes (16 words) - 14:16, 28 January 2024
- contract networks 2023-09-19 Paper On stable flows and preflows 2023-05-23 Paper Maximum skew-symmetric flows 2023-05-08 Paper On interrelations between...10 bytes (19 words) - 21:33, 11 December 2023
- de/entity/Q3840342 1999-04-08 Paper Multiterminal flows and cuts 1996-10-20 Paper Optimal node disjoint paths on partial 2-trees: A linear algorithm and...10 bytes (17 words) - 16:36, 6 December 2023
- mardi4nfdi.de/entity/Q2934642 2014-12-18 Paper Disjoint paths in tournaments 2014-12-12 Paper Edge-disjoint paths in digraphs with bounded independence number...10 bytes (19 words) - 23:39, 9 December 2023
- 2018-10-30 Paper Minimum-cost flows in unit-capacity networks 2018-02-01 Paper A Randomized Concurrent Algorithm for Disjoint Set Union 2017-09-29 Paper https://portal...10 bytes (19 words) - 21:52, 9 December 2023
- Convex \(p\)-partitions of bipartite graphs 2015-12-08 Paper Allowing each node to communicate only once in a distributed system: shared whiteboard models...10 bytes (16 words) - 20:15, 8 December 2023
- approximation 2010-09-16 Paper Separation, dimension, and facet algorithms for node flow polyhedra 2010-09-16 Paper https://portal.mardi4nfdi.de/entity/Q3579438...10 bytes (19 words) - 11:24, 8 December 2023
- Multicommodity Flow Problem 2013-11-14 Paper Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs 2013-08-12 Paper Maximum Edge-Disjoint Paths...10 bytes (17 words) - 10:27, 6 October 2023
- Oblivious routing on node-capacitated and directed graphs 2018-11-05 Paper Ordinal embeddings of minimum relaxation 2018-11-05 Paper Node-Weighted Steiner...10 bytes (19 words) - 23:41, 9 December 2023
- Type Min–max optimization of node‐targeted attacks in service networks 2024-03-15 Paper Maximizing SDN resilience to node‐targeted attacks through joint...10 bytes (16 words) - 10:16, 11 December 2023
- embedding for fault tolerance in balanced hypercubes 2016-05-02 Paper Two node-disjoint paths in balanced hypercubes 2016-04-28 Paper The genus of the balanced...10 bytes (17 words) - 18:06, 9 December 2023
- Traveling Salesman (Path) Problem 2023-06-30 Paper Sequence Hypergraphs: Paths, Flows, and Cuts 2023-06-30 Paper https://portal.mardi4nfdi.de/entity/Q5875632 2023-02-03...10 bytes (16 words) - 21:56, 10 December 2023
- by edge-disjoint paths 2003-08-19 Paper Efficient algorithm for transversal of disjoint convex polygons. 2003-01-21 Paper Transversal of disjoint convex...10 bytes (21 words) - 16:44, 9 December 2023
- approximation framework for fractional network flow and packing problems 2018-02-09 Paper Maximum flows in generalized processing networks 2017-08-03 Paper...10 bytes (18 words) - 17:14, 7 December 2023
