✦ LIBER ✦

Methods of regularization in factorization problems

✍ Scribed by L.P. Nizhnik; R.A. Rozanov

Publisher: Elsevier Science
Year: 1982
Weight: 487 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90123-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimates of the error of regularization

Estimates of the error of regularization methods for normally solvable problems

✍ G.M. Vainikko 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 732 KB

Regular factors in regular graphs

✍ P. Katerinis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.

Use of the regularization method in non-

Use of the regularization method in non-linear problems

✍ A.N. Tikhonov; V.B. Glasko 📂 Article 📅 1965 🏛 Elsevier Science ⚖ 816 KB

The method of iterative regularization i

The method of iterative regularization in constrained minimization problems

✍ D.V. Denisov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 658 KB

Regular factors in nearly regular graphs

✍ Jean-Claude Bermond; Michel Las Vergnas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a