An algebraic theory of graph reduction-Reference-Cited by-同舟云学术

An algebraic theory of graph reduction

Published: Issue: Volume: Page:70-83
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arnborg Stefan,Courcelle Bruno,Proskurowski Andrzej,Seese Detlef

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0017382

Reference38 articles.

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

2. S. Arnborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability — A Survey, BIT 25 (1985), 2–33

3. S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of Finding Embeddings in a k-tree, SIAM J. Alg. and Discr. Methods 8(1987), 277–287

4. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese,An algebraic theory of graph reduction, Technical Report LaBRI TR 90-02, University of Bordeaux (1990).

5. S. Arnborg, J. Lagergren and D. Seese, Problems Easy for Tree-decomposable graphs (extended abstract). Proc. 15 th ICALP, Springer Verlag, Lect. Notes in Comp. Sc.317 (1988) 38–51

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

1. Vertex deletion parameterized by elimination distance and even less;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

2. Backdoor Treewidth for SAT;Theory and Applications of Satisfiability Testing – SAT 2017;2017

3. Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery;Graph Transformation;2002

4. Qualitative circuit models in failure analysis reasoning;Artificial Intelligence;1999-07

5. Bounded Tree-Width and LOGCFL;Journal of Algorithms;1994-05