Sciweavers

TCS
2010

On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs

12 years 10 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
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 strengthening previous results on the same problem. We show a relation between this problem and two interval operators: the simple path interval operator in hypergraphs and the even-chorded path interval operator in graphs. We show that the problem of computing the two mentioned intervals is NPcomplete. Key words: Chordless paths; Bipartite graphs; Interval operators; Graphs convexity; Simple paths; Even-chorded paths
Mauro Mezzini
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where TCS
Authors Mauro Mezzini
Comments (0)