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
✦ LIBER ✦
The Complexity of König Subgraph Problems and
✍ Scribed by Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar; C. R. Subramanian
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 778 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0178-4617
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 complexity of regular subgraph recog
✍
F. Cheah; D.G. Corneil
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 600 KB
The Moments for the Meyer-König and Zell
✍
U. Abel
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 232 KB
✍
Harry Harrison; John Holm
📂
Fiction
📅
2016
🏛
Mantikore-Verlag
🌐
German
⚖ 479 KB
Die Welt ist im Wandel in England des Jahres 867 – Mönche und Bischöfe herrschen nun nicht mehr über halb England, doch auch die wilden Wikinger Horden unter ihrem brutalen Anführer Ragnarsson können nun nicht länger ohne Gegenwehr in die englischen Grafschaften einfallen. Der siegreiche Shef S
The complexity of subgraph isomorphism f
✍
Arvind Gupta; Naomi Nishimura
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 882 KB
A branch-and-cut algorithm for the k-edg
✍
F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 301 KB
👁 1 views