A note on packing paths in planar graphs |
| |
Authors: | András Frank Zoltán Szigeti |
| |
Institution: | (1) Department of Computer Science, Eötvös University, Múzeum krt. 6-8, H-1088 Budapest, Hungary |
| |
Abstract: | Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271. |
| |
Keywords: | Disjoint paths Joins Packing cuts |
本文献已被 SpringerLink 等数据库收录! |