A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs-Reference-Cited by-同舟云学术

A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

Published:2000-02 Issue:1-3 Volume:99 Page:367-400
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Broersma H.J.,Dahlhaus E.,Kloks T.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference23 articles.

1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebra Discrete Math.,1987

2. Distance-hereditary graphs;Bandelt;J. Combin. Theory (B),1986

3. H. Bodlaender, T. Kloks, D. Kratsch, H. Müller, Treewidth and minimum fill-in on d-trapezoid graphs, Technical Report RUU-CS-1995-34, Utrecht University, The Netherlands, 1995.

4. Treewidth and pathwidth of permutation graphs;Bodlaender;SIAM J. Discrete Math.,1995

5. H. Bodlaender, R. Möhring, The pathwidth and treewidth of cographs, Proceedings of the second Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 447, Springer, Berlin, 1990, pp. 301–309.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Twin-distance-hereditary digraphs;Theoretical Computer Science;2023-08

2. Adding a Tail in Classes of Perfect Graphs;Algorithms;2023-06-03

3. Faster and enhanced inclusion-minimal cograph completion;Discrete Applied Mathematics;2021-01

4. Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs;Lecture Notes in Computer Science;2021

5. Fast and simple algorithms for counting dominating sets in distance-hereditary graphs;Discrete Mathematics, Algorithms and Applications;2020-10-05