Efficient reassembling of three-regular planar graphs

@article{Kfoury2020EfficientRO,
  title={Efficient reassembling of three-regular planar graphs},
  author={A. Kfoury and Benjamin Sisson},
  journal={Journal of Combinatorial Optimization},
  year={2020},
  volume={39},
  pages={1153-1207}
}
  • A. Kfoury, Benjamin Sisson
  • Published 2020
  • Computer Science, Mathematics
  • Journal of Combinatorial Optimization
  • A reassembling of a simple graph $$G = (V,E)$$ G = ( V , E ) is an abstraction of a problem arising in earlier studies of network analysis (Bestavros and Kfoury, in: Proceedings of IFIP working conference on domain-specific 1640 languages (DSL 2011), EPTCS volume 66, 2011; Kfoury, in: Proceedings of SBLP 2011: Brazilian symposium on programming; Kfoury, in Sci Comput Program 93(Part A):19–38; Soule et al., in: Proceedings of 4th international workshop on equation-based object oriented modeling… CONTINUE READING
    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 17 REFERENCES
    Efficient reassembling of graphs, part 1: the linear case
    6
    Efficient Reassembling of Graphs, Part 2: The Balanced Case
    3
    Disjoint paths in sparse graphs
    • C. Bentz
    • Computer Science, Mathematics
    • 2009
    3
    Why Should Biconnected Components be Identified First
    7
    Call routing and the ratcatcher
    335
    Determining the Smallest k Such That G Is k -Outerplanar
    19
    Algorithm 447: efficient algorithms for graph manipulation
    478
    Optimal branch-decomposition of planar graphs in O(n3) Time
    92
    Planarity Testing and Embedding
    29