Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514608 | Electronic Notes in Discrete Mathematics | 2005 | 7 Pages |
Abstract
In this paper we deal with the problem of partitioning the edge set of a bipartite graph G=(LâªR,E) with prescribed layout into the minimum number of non-crossing b-matchings. Some bounds and properties are discussed and an exact O(|E|loglogmin{|L|,|R|}) is presented for its solution.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Federico Malucelli, Sara Nicoloso,