A. Rajaraman, H. Balakrishnan, and C. Pandu Rangan. Modular decomposition techniques for distance-hereditary graphs. Unpublished Manuscript, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient and Constructive Algorithms for the Pathwidth and.. - Bodlaender, Kloks (1993) (16 citations) (Correct)
....been done on the problem of determining the treewidth and pathwidth of a graph, and finding tree or path decompositions with optimal treewidth or pathwidth. These problems are NP complete [3] Research has been done on determining the treewidth and pathwidth of special classes of graphs (see e.g. [18, 17, 24, 27, 29, 28, 26, 36, 44], on approximation algorithms for treewidth and pathwidth (e.g. 15] and on the case that the parameter k is a fixed constant. See e.g. 11] for an overview. This paper addresses the case that k is a fixed constant. The first known algorithms, solving the treewidth and pathwidth problems for ....
A. Rajaraman, H. Balakrishnan, and C. Pandu Rangan. Modular decomposition techniques for distance-hereditary graphs. Unpublished Manuscript, 1993.
How to Use the Minimal Separators of a Graph for Its Chordal .. - Parra, Scheffler (1994) (21 citations) (Correct)
....the treewidth of a graph [2] For several graph classes, however, there are polynomial time algorithms available for the Treewidth problem. These are cographs, permutation graphs, circle graphs, circular arc graphs, distancehereditary graphs and co comparability graphs of bounded dimension [5, 4, 16, 30, 27, 20]. For co bipartite graphs and hence for co comparability graphs the problem The research of the first author has been supported by the graduate school Algorithmische Diskrete Mathematik by the Deutsche Forschungsgemeinschaft, grant We 1265 2 1. 2 ANDREAS PARRA AND PETRA SCHEFFLER is NP hard ....
A. Rajaraman, H. Balakrishnan, and C. Pandu Rangan. Modular decomposition techniques for distance-hereditary graphs. Manuscript, 1994.
Efficient and Constructive Algorithms for the Pathwidth and.. - Bodlaender, Kloks (1993) (16 citations) (Correct)
....been done on the problem of determining the treewidth and pathwidth of a graph, and finding tree or path decompositions with optimal treewidth or pathwidth. These problems are NP complete [3] Research has been done on determining the treewidth and pathwidth of special classes of graphs (see e.g. [18, 17, 24, 27, 29, 28, 26, 36, 44], on approximation algorithms for treewidth and pathwidth (e.g. 15] and on the case that the parameter k is a fixed constant. See e.g. 11] for an overview. This paper addresses the case that k is a fixed constant. The first known algorithms, solving the treewidth and pathwidth problems for ....
A. Rajaraman, H. Balakrishnan, and C. Pandu Rangan. Modular decomposition techniques for distance-hereditary graphs. Unpublished Manuscript, 1993.
Efficient Algorithms on Asteroidal Triple-Free and Distance.. - Balakrishnan (1993) Self-citation (Rangan) (Correct)
....by the properties of minimal separators. It would be interesting to investigate if the same or similar techniques can be extended to obtain efficient algorithms for some other problems too. We mention here that we have solved the problem of computing the treewidth of distance hereditary graphs [27] using an extension of the techniques presented in this Chapter. 47 Chapter 6 Concluding Remarks and Open Problems 6.1 Conclusions An important method of overcoming the intractable nature of problems in graphs is to focus attention on special classes of graphs and try to obtain solutions for ....
Anand Rajaraman, Hari Balakrishnan, and C. Pandu Rangan. Modular decomposition techniques for distance-hereditary graphs. Technical Report TR-TCS-93-03, Dept. of Computer Science and Engineering, Indian Institute of Technology, Madras, India, 1993.
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