Published November 14, 2017
| Version author proofs
Journal article
Open
Minimal path decomposition of complete bipartite graphs
Creators
- 1. KIOS Research Center, Department of Electrical and Computer Engineering, University of Cyprus
Description
This paper deals with the subject of minimal path decomposition of complete bipartite graphs. A path decomposition of a graph is a decomposition of it into simple paths such that every edge appears in exactly one path. If the number of paths is the minimum possible, the path decomposition is called minimal. Algorithms that derive such decompositions are presented, along with their proof of correctness, for the three out of the four possible cases of a complete bipartite graph.
Files
10878_2017_200_Author_Zenodo.pdf
Files
(264.0 kB)
Name | Size | Download all |
---|---|---|
md5:7fa763fedc667b9942c7ccaf75f90f7d
|
264.0 kB | Preview Download |