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

Author： Ido Hideshi   Ohama Yosuke   Takahashi Tomoki  

Publisher： Springer Publishing Company

ISSN： 1433-5298

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

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

Edge and node searching problems on trees

By Peng  

Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. : 429-446

Elsevier

Access to resources Recommend Favorite

Graph layout for applications in compiler construction

By Sander G.  

Theoretical Computer Science, Vol. 217, Iss. 2, 1999-04 ,pp. : 175-214

Elsevier

Access to resources Recommend Favorite

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

Shortcomings with using edge encodings to represent graph structures

By Hornby Gregory  

Genetic Programming and Evolvable Machines, Vol. 7, Iss. 3, 2006-10 ,pp. : 231-252

Springer Publishing Company

Access to resources Recommend Favorite

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

By Caria Pablo  

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

Springer Publishing Company

Access to resources Recommend Favorite