On Computing the Subset Graph of a Collection of Sets

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.33, Iss.2, 1999-11, pp. : 187-203

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

A note on the independent domination number of subset graph

By Chen Xue-gang Ma De-xiang Xing Hua-Ming Sun Liang

Czechoslovak Mathematical Journal, Vol. 55, Iss. 2, 2005-06 ,pp. : 511-517

Springer Publishing Company

Access to resources Recommend Favorite

Computing the hyperbolicity constant of a cubic graph

By Rodríguez José M. Sigarreta Jose M. Torres Yadira

International Journal of Computer Mathematics, Vol. 91, Iss. 9, 2014-09 ,pp. : 1897-1910

Taylor & Francis Ltd

Access to resources Recommend Favorite

On pitfalls in computing the geodetic number of a graph

By Hansen Pierre Omme Nikolaj

Optimization Letters, Vol. 1, Iss. 3, 2007-06 ,pp. : 299-307

Springer Publishing Company

Access to resources Recommend Favorite

Computing an Integer Point of a Class of Convex Sets

By Dang C.

Journal of Optimization Theory and Applications, Vol. 108, Iss. 2, 2001-02 ,pp. : 333-348

Springer Publishing Company

Access to resources Recommend Favorite

The coordination index of finite collection of fuzzy sets

By Tsabadze T.

Fuzzy Sets and Systems, Vol. 107, Iss. 2, 1999-10 ,pp. : 177-185

Elsevier

Access to resources Recommend Favorite