On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs.
Mauro MezziniPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- bipartite graph
- maximum cardinality
- graph model
- graph clustering
- maximum matching
- link prediction
- minimum weight
- computational complexity
- bipartite graph matching
- bipartite networks
- graph theory
- maximum weight
- edge weights
- worst case
- data sets
- shortest path
- labeled graphs
- mutual reinforcement
- pairwise
- reinforcement learning