4551
правка
Путевая ширина графа: различия между версиями
Материал из WEGA
→Литература
Irina (обсуждение | вклад) |
Irina (обсуждение | вклад) |
||
| Строка 86: | Строка 86: | ||
== Литература == | == Литература == | ||
1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33,461-493 (2002) | 1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33,461-493 (2002) | ||
2. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT 25,2-23 (1985) | 2. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT 25,2-23 (1985) | ||
3. Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Automata, languages and programming (Bologna, 1997). Lecture Notes in Computer Science, vol. 1256, pp. 627-637. Springer, Berlin (1997) | 3. Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Automata, languages and programming (Bologna, 1997). Lecture Notes in Computer Science, vol. 1256, pp. 627-637. Springer, Berlin (1997) | ||
4. Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. J. Algorithms 32,167-194(1999) | 4. Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. J. Algorithms 32,167-194(1999) | ||
5. Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. Inf. J. Comput. 15, 233-248 (2003) | 5. Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. Inf. J. Comput. 15, 233-248 (2003) | ||
