Efficient algorithms for combinatorial problems on graphs with bounded decomposability

Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

Published:1985-03 Issue:1 Volume:25 Page:1-23
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Arnborg Stefan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01934985.pdf

Reference33 articles.

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,Design and Analysis of Computer Algorithms, Reading, Mass. Addison-Wesley, 1974.

2. S. Arnborg,Reduced state enumeration — another algorithm for reliability evaluation, IEEE Trans. Reliability R-27 (1978), 101–105.

3. FOA Rapport C;S. Arnborg,1979

4. S. Arnborg, D. G. Corneil and A. Proskurowski,Complexity of finding embeddings in a k-tree, TRITA-NA 8407, Royal Institute of Technology, Sweden (1984).

5. S. Arnborg and A. Proskurowski,Characterization and recognition of partial k-trees, TRITA-NA 8402, Royal Institute of Technology, Sweden (1984).

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

1. Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth;Lecture Notes in Computer Science;2024

2. The Bounded Pathwidth of Control-Flow Graphs;Proceedings of the ACM on Programming Languages;2023-10-16

3. Construction of FANETs for user coverage and information transmission in disaster rescue scenarios;Computer Communications;2023-07

4. Treewidth-based algorithms for the small parsimony problem on networks;Algorithms for Molecular Biology;2022-08-20

5. Modelling of Dispatching Functions in the Language of Decision Tables Using the Negation and Minimization Algorithms for Disjunctive Normal Forms;SMART Automatics and Energy;2022