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}
}
  • A. Kfoury, Saber Mirzaei
  • 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

    Figures and Topics from this paper.

    Efficient reassembling of three-regular planar graphs
    2
    Efficient Reassembling of Graphs, Part 2: The Balanced Case
    3
    Minimum Average Delay of Routing Trees
    2
    A theory of flow network typings and its optimization problems
    A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
    A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
    2

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES
    ℓ22 Spreading Metrics for Vertex Ordering Problems
    43
    Some Simplified NP-Complete Graph Problems
    1773
    New approximation techniques for some ordering problems
    79
    An introduction to treewidth
    4
    Min Cut is NP-Complete for Edge Weighted Treees
    133
    Addenda to the Survey of Layout Problems
    32