Corpus ID: 54457338

Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs

@article{Dahn2018FixedParameterAF,
  title={Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs},
  author={Christine Dahn and Nils M. Kriege and Petra Mutzel and Julian Schilling},
  journal={ArXiv},
  year={2018},
  volume={abs/1812.03074}
}
  • Christine Dahn, Nils M. Kriege, +1 author Julian Schilling
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithms recursively reduce a 1-planar graph to at most 3^k planar graphs, using edge removal and node contraction. Our main algorithm then solves the Max-Cut problem for the planar graphs using the FCE-MaxCut introduced… CONTINUE READING

    Citations

    Publications citing this paper.

    Maximum Cut Parameterized by Crossing Number

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES

    Partitioning planar graphs: a fast combinatorial approach for max-cut

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Unifying Maximum Cut and Minimum Cut of a Planar Graph

    VIEW 2 EXCERPTS

    Parameterized Complexity of 1-Planarity

    VIEW 2 EXCERPTS

    Linear-Time Algorithms for the Max Cut Problem