On the complexity of the k-chain subgraph cover problem

Autor:	Chang-Wu, Yu, Gen-Huey, Chen, Tze-Heng, Ma
Zdroj:	In Theoretical Computer Science 1998 205(1):85-98
Databáze:	ScienceDirect
Externí odkaz:	Zobrazit plný text záznamu Full Text from ScienceDirect