NC Algorithms for Recognizing Partial 2-Trees and 3-Trees

DOI10.1137/0404031MaRDI QIDQ3358764zbMATH OpenOpenAlexFDO

Authors Daniel Granot, Darko Skorin-Kapov

Publication date 1991

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0404031

zbMATH Keywords

development of algorithmsNC algorithmspartial k- treesrecognitionstructural properties of k-trees

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 4094838
• NC algorithms for recognizing chordal graphs and k trees
• Characterization of partial 3-trees in terms of three structures
• A characterization of partial 3-trees
• scientific article; zbMATH DE number 4008410

Cited in

(4)

• Canonical representations of partial 2- and 3-trees
• Characterization and Recognition of Partial 3-Trees
• NC algorithms for recognizing chordal graphs and k trees
• NC algorithms for partitioning sparse graphs into induced forests with an application

This page was built for publication: NC Algorithms for Recognizing Partial 2-Trees and 3-Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358764)