On the complexity of the maximum cut problem-Reference-Cited by-同舟云学术

On the complexity of the maximum cut problem

Published:1994 Issue: Volume: Page:769-780
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bodlaender Hans L.,Jansen Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57785-8_189

Reference19 articles.

1. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey. BIT 25 (1985) 2–23.

2. Bodlaender, H.L.: Achromatic Number is NP-complete for cographs and interval graphs. Information Processing Letters 31 (1989) 135–138.

3. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proceedings of the 25th Annual Symposium on Theory of Computing, pages 226–234. ACM Press, 1993.

4. Bodlaender, H.L.: A tourist guide through treewidth. Technical Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, 1992. To appear in: Acta Cybernetica.

5. Chang, K., Du, D.: Efficient algorithms for the layer assignment problem. IEEE Trans. CAD 6 (1987) 67–78.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DOT: Towards Fast Decision Tree Packet Classification by Optimizing Rule Partitions;2024 IEEE 49th Conference on Local Computer Networks (LCN);2024-10-08

2. On 1-Skeleton of the Cut Polytopes;Lecture Notes in Computer Science;2024

3. Stochastic Implementation of Simulated Quantum Annealing on PYNQ;2023 International Conference on Field Programmable Technology (ICFPT);2023-12-12

4. MaxCut on permutation graphs is NP‐complete;Journal of Graph Theory;2023-02-27

5. Solving a cut problem in bipartite graphs by linear programming: Application to a forest management problem;Applied Mathematical Modelling;2010-04