# Efficient reassembling of graphs, part 1: the linear case

@article{Kfoury2017EfficientRO,
title={Efficient reassembling of graphs, part 1: the linear case},
author={A. Kfoury and Saber Mirzaei},
journal={Journal of Combinatorial Optimization},
year={2017},
volume={33},
pages={1057-1089}
}
• Published 2017
• Computer Science, Mathematics
• Journal of Combinatorial Optimization
• The reassembling of a simple connected graph$$G = (V,E)$$G=(V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps:(1)We cut every edge of G into two halves, thus obtaining a collection of $$n = |\,V\,|$$n=|V| one-vertex components, such that for every $$v\in V$$v∈V the one-vertex component $$\{ v \}$${v} has $${{degree}}_{}(v)$$degree(v) half edges attached to it.(2)We splice the two halves of every edge together, not of all… CONTINUE READING