The Khalimsky topologies are precisely those simply connected topologies on Z n whose connected sets include all 2n-connected sets but no (3 n -1)-disconnected sets

Author： Kong T.Y.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.305, Iss.1, 2003-08, pp. : 221-235

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

Approximation Algorithms for Connected Dominating Sets

By Guha S.   Khuller S.  

Algorithmica, Vol. 20, Iss. 4, 1998-04 ,pp. : 374-387

Springer Publishing Company

Access to resources Recommend Favorite

Learning sets and topologies

By Choudhury Masudul Alam   Zaman S.I.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 35, Iss. 10, 2006-12 ,pp. : 1567-1578

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems

By Kearfott R.  

Computing, Vol. 82, Iss. 1, 2008-04 ,pp. : 77-102

Springer Publishing Company

Access to resources Recommend Favorite

A local algorithm to compute multiple connected dominating sets in wireless sensor networks

By Islam Kamrul   Akl Selim G.  

International Journal of Parallel, Emergent and Distributed Systems, Vol. 26, Iss. 5, 2011-10 ,pp. : 369-380

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving Connected Dominating Set Faster than 2 n

By Fomin Fedor   Grandoni Fabrizio   Kratsch Dieter  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 153-166

Springer Publishing Company

Access to resources Recommend Favorite