Funder
Austrian Science Fund
H2020 European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. Akiyama, J., Kano, M.: Factors and factorizations of graphsa survey. J. Graph Theory 9(1), 1–42 (1985)
2. Bellman, R.E.: Dynamic programming treatment of the traveling salesman problem. J. ACM 9, 61–63 (1962)
3. Cheah, F., Corneil, D.G.: The complexity of regular subgraph recognition. Discrete Appl. Math. 27(1–2), 59–68 (1990)
4. Chung, F.R.K., Graham, R.L.: Recent results in graph decompositions. Lond. Math. Soc. Lect. Note Ser. 52, 103–123 (1981)
5. Cornelissen, K., Hoeksma, R., Manthey, B., Narayanaswamy, N.S., Rahul, C.S., Waanders, M.: Approximation algorithms for connected graph factors of minimum weight. Theory Comput. Syst. 62(2), 441–464 (2018)