Concepedia

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees

Martin Charles Golumbic, Aviad Mintz, Udi Rotics

Discrete Applied Mathematics · 2006 · 40 citations · 23 references

DOI

Concepts

References

23

SIS : A System for Sequential Circuit Synthesis

Ellen Sentovich · 1992 · 1.9K citations

, , +17

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.6K citations

, , +11

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

, , +15

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 874 citations

, , +9

Complement reducible graphs

Derek G. Corneil, H. Lerchs, L.Stewart Burlingham · Discrete Applied Mathematics · 1981 · 837 citations