# 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} }

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

6 Citations

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

- Mathematics, Computer Science
- 2018

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

- Mathematics, Computer Science
- 2018

2

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 31 REFERENCES

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth

- Mathematics, Computer Science
- 2001

19

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

- Computer Science
- 1999

817

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

- Mathematics, Computer Science
- 2002

70