Search results
From MaRDI portal
- Paper Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 2023-10-05 Paper Good orientations of unions of edge‐disjoint spanning...10 bytes (16 words) - 12:10, 11 December 2023
- Paper Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments 2004-08-16 Paper Interval bigraphs and circular arc graphs 2004-08-16...10 bytes (16 words) - 01:04, 9 December 2023
- problem over cyclic groups 2016-08-22 Paper Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms 2016-06-01 Paper A family...10 bytes (17 words) - 04:28, 9 December 2023
- de/entity/Q2816010 2016-07-01 Paper The complexity of finding arc-disjoint branching flows 2016-06-21 Paper https://portal.mardi4nfdi.de/entity/Q2809939...10 bytes (16 words) - 10:09, 8 December 2023
- feedback arc set in tournaments 2012-01-11 Paper Hitting and Harvesting Pumpkins 2011-09-16 Paper Kernel bounds for disjoint cycles and disjoint paths 2011-09-12...10 bytes (17 words) - 07:10, 9 December 2023
- of Publication Type From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows 2024-04-18 Paper FPT algorithms for packing...10 bytes (18 words) - 14:41, 6 October 2023
- de/entity/Q3179899 2017-01-06 Paper Nowhere-zero 15-flow in 3-edge-connected bidirected graphs 2014-06-03 Paper On spanning disjoint paths in line graphs 2014-02-14 Paper...10 bytes (17 words) - 23:53, 11 December 2023
- study on travelling salesman problems 2021-11-09 Paper Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation...10 bytes (18 words) - 18:41, 9 December 2023
- graphic arrangements, and partial orders 2024-01-29 Paper Finding Maximum Edge-Disjoint Paths Between Multiple Terminals 2023-10-26 Paper A Pfaffian formula...10 bytes (16 words) - 12:23, 28 January 2024
- de/entity/Q2816100 2016-07-01 Paper The complexity of finding arc-disjoint branching flows 2016-06-21 Paper Finding good 2-partitions of digraphs. I. Hereditary...10 bytes (16 words) - 20:15, 8 December 2023
- Paper A note on the parametric maximum flow problem and some related reoptimization issues 2008-03-31 Paper The maximum congested cut problem and its robust...10 bytes (18 words) - 02:58, 11 December 2023
- colorings and DP-colorings of multigraphs using edge-disjoint decompositions 2021-11-30 Paper Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite...10 bytes (19 words) - 14:02, 8 December 2023
- to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph 2010-09-02 Paper Arc-disjoint in-trees in directed...10 bytes (16 words) - 02:47, 25 September 2023
- programming. 2008-01-25 Paper Flows over edge-disjoint mixed multipaths and applications 2007-09-19 Paper Multiroute flows: cut-trees and realizability...10 bytes (20 words) - 09:36, 25 September 2023
- Nowhere-zero 3-flows and modulo \(k\)-orientations 2014-10-13 Paper Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture...10 bytes (17 words) - 17:15, 9 December 2023
- structural parameters 2018-12-06 Paper Maximum colorful cycles in vertex-colored graphs 2018-11-28 Paper Maximum colorful independent sets in vertex-colored...10 bytes (17 words) - 13:42, 28 January 2024
- Paper The multiroute maximum flow problem revisited 2006-05-16 Paper An improved algorithm for decomposing arc flows into multipath flows 2006-01-18 Paper...10 bytes (17 words) - 19:55, 8 December 2023
- shortest string containing all r- permutations 1982-01-01 Paper The maximum number of arc-disjoint arborescences in a tournament 1982-01-01 Paper https://portal...10 bytes (17 words) - 20:22, 8 December 2023
- Publication Date of Publication Type Constructing Maximal Dynamic Flows from Static Flows 2019-06-03 Paper On a Linear-Programming, Combinatorial Approach...10 bytes (19 words) - 17:21, 6 October 2023
- Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs 2021-06-22 Paper Grid Peeling and the Affine Curve-Shortening Flow 2021-04-01 Paper Counting...10 bytes (17 words) - 15:15, 10 December 2023
