2 search results - page 1 / 1 » Computing simple-path convex hulls in hypergraphs |
96
Voted
IPL
2011
14 years 10 months ago
2011
130
Voted
TCS
2010
14 years 10 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...