H.L. Bodlaender, A tourist guide through treewidth, Technical report RUU-CS-92-12, Department of computer science, Utrecht University, Utrecht, The Netherlands, 1992. To appear in: Proceedings 7 th International Meeting of Young Computer Scientists, Springer Verlag, Lecture Notes in Computer Science. 14 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Treewidth and Pathwidth of Permutation Graphs - Bodlaender, Kloks, Kratsch (1992) (22 citations) Self-citation (Bodlaender) (Correct)
....chordless cycle of length at least four. Chordal graphs are also called triangulated. There are basically two ways two define the treewidth of a graph. One way is to use the concept of a tree decomposition. For more information on tree decompositions the reader is referred to the survey paper [10]. In this paper we introduce the treewidth of a graph by means of k trees. Definition 2.2 Let k be an integer. A k tree is a graph which is defined recursively as follows. A clique with k 1 vertices is a k tree. Given a k tree Tn with n vertices, a kotree with n 1 vertices can be constructed ....
H.L. Bodlaender, A tourist guide through treewidth, Technical report RUU-CS-92-12, Department of computer science, Utrecht University, Utrecht, The Netherlands, 1992. To appear in: Proceedings 7 th International Meeting of Young Computer Scientists, Springer Verlag, Lecture Notes in Computer Science. 14
On the Treewidth and Pathwidth of Permutation Graphs - Kloks, al. (1992) (22 citations) Self-citation (Bodlaender) (Correct)
....can be computed in linear time ( 9] In this case, when also the pathwidth is bounded, also the pathwidth and a optimal path decomposition can be computed in linear time. For an introductory overview of recent results dealing with treewidth and pathwidth, the reader is referred to [6]. In the next section we show that, if a permutation graph G has treewidth at most k then the pathwidth is at most 2k, and there exists an O(kn) algorithm to find a path decomposition for G with width at most 2k. For constant k, this shows the existance of linear time algorithms to compute the ....
H.L. Bodlaender, A tourist guide through treewidth, Technical report RUU-CS-92-12, DeP.rtment of computer science, Utrecht University, Utrecht, The Netherlands, 1992. To appear in: Proceedings 7th International Meeting of Young Computer Scientists, Springer Verlag Lecture Notes in Computer Sci- ence.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC