Determining what sets of trees can be the clique trees of a chordal graph

ISSN： 0104-6500

Source： Journal of the Brazilian Computer Society, Vol.18, Iss.2, 2012-06, pp. : 121-128

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

By Fomin Fedor V. Heggernes Pinar Telle Jan Arne

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 73-87

Springer Publishing Company

Access to resources Recommend Favorite

Graph construction with the maximum number of trees by continuous edge addition

By Ido Hideshi Ohama Yosuke Takahashi Tomoki

Artificial Life and Robotics, Vol. 10, Iss. 2, 2006-11 ,pp. : 185-188

Springer Publishing Company

Access to resources Recommend Favorite

Fusion trees can be implemented with AC 0 instructions only

By Andersson A. Miltersen P.B. Thorup M.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 337-344

Elsevier

Access to resources Recommend Favorite

Functional Trees

By Gama João

Machine Learning, Vol. 55, Iss. 3, 2004-06 ,pp. : 219-250

Springer Publishing Company

Access to resources Recommend Favorite

Periodicities on trees

By Giammarresi D. Mantaci S. Mignosi F. Restivo A.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 145-181

Elsevier

Access to resources Recommend Favorite