✦ 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
DOI: 10.1016/0304-3975(96)00046-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isomorphism testing of k-trees is in NC,

Isomorphism testing of k-trees is in NC, for fixed k

✍ N. Chandrasekharan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

On the complexity of the k-chain subgrap

On the complexity of the k-chain subgraph cover problem

✍ 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

The number of isomorphism classes of spr

The number of isomorphism classes of spreads

✍ Eric K. van Douwen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 779 KB

The complexity of harmonious colouring f

The complexity of harmonious colouring for trees

✍ Keith Edwards; Colin McDiarmid 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 510 KB

On the Complexity of the Isomorphism Rel

On the Complexity of the Isomorphism Relation for Finitely Generated Groups

✍ Simon Thomas; Boban Velickovic 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

On the complexity of the isomorphism rel

On the complexity of the isomorphism relation for fields of finite transcendence degree

✍ Simon Thomas; Boban Velickovic 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 148 KB