Efficient reassembling of graphs, part 1: the linear case

The reassembling of a simple connected graph \(G = (V,E)\) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: A component A is a subset of V and its edge-boundary degree is the number of edges in G with one endpoint in A and one endpoint in \(V-A\) (which is the same as the number of half edges attached to A after all edges with both endpoints in A have been spliced together). The maximum edge-boundary degree encountered during the reassembling process is what we call the \(\varvec{\alpha }\) -measure of the reassembling, and the sum of all edge-boundary degrees is its \(\varvec{\beta }\) -measure. The \(\alpha \)-optimization (resp. \(\beta \)-optimization) of the reassembling of G is to determine an order \(\Theta \) for splicing the edges that minimizes its \(\alpha \)-measure (resp. \(\beta \)-measure). There are different forms of reassembling, depending on restrictions and variations on the ordering \(\Theta \) of the edges. We consider only cases satisfying the condition that if an edge between disjoint components A and B is spliced, then all the edges between A and B are spliced at the same time. In this report, we examine the particular case of linear reassembling, which requires that the next edge to be spliced must be adjacent to an already spliced edge. We delay other forms of reassembling to follow-up reports. We prove that \(\alpha \)-optimization of linear reassembling and minimum-cutwidth linear arrangment (\(\mathrm{CutWidth}\)) are polynomially reducible to each other, and that \(\beta \)-optimization of linear reassembling and minimum-cost linear arrangement (\(\mathrm{MinArr}\)) are polynomially reducible to each other. The known NP-hardness of \(\mathrm{CutWidth}\) and \(\mathrm{MinArr}\) imply the NP-hardness of \(\alpha \)-optimization and \(\beta \)-optimization.