Notes on Equitable Partition into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs

24 Mar 2020 Takazawa Kenjiro

An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one. For a digraph whose arc set can be partitioned into $k$ branchings, there always exists an equitable partition into $k$ branchings... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS
  • DATA STRUCTURES AND ALGORITHMS