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

Authors:
Mauro Mezzini
Affiliations:
Sapienza University, Roma, Italy
Venue:
Theoretical Computer Science
Year:
2010

Citing 11
Cited 1

Connections in acyclic hypergraphs

Theoretical Computer Science
Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
On hypergraph acyclicity and graph chordality

Information Processing Letters
On the complexity of testing for odd holes and induced odd paths

Discrete Mathematics
A fast algorithm for query optimization in universal-relation databases

Journal of Computer and System Sciences
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Chordless paths through three vertices

Theoretical Computer Science - Parameterized and exact computation
Even-hole-free graphs part I: Decomposition theorem

Journal of Graph Theory
Even-hole-free graphs part II: Recognition algorithm

Journal of Graph Theory
Detecting even holes

Journal of Graph Theory

Computing simple-path convex hulls in hypergraphs

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 the 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 NP-complete.