Computing transitive closure of bipolar weighted digraphs.
Patrick NiesinkKeven PoulinMateja SajnaPublished in: Discret. Appl. Math. (2013)
Keyphrases
- transitive closure
- expressive power
- constraint databases
- directed acyclic graph
- query evaluation
- recursive queries
- first order logic
- binary relations
- relational algebra
- query language
- directed graph
- spatial databases
- data complexity
- video sequences
- similarity measure
- graphical models
- databases
- artificial intelligence