๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of subgraph isomorphism for classes of partial k-trees

โœ Scribed by Arvind Gupta; Naomi Nishimura


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
882 KB
Volume
164
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the complexity of the k-chain subgrap
โœ Yu Chang-Wu; Chen Gen-Huey; Ma Tze-Heng ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB

The k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the union of the edge sets of k chain graphs, where each chain graph is a subgraph of G. Although the X--chain subgraph cover problem is known to be NP-complete for the class of bipartite graphs, it is still unkn