Maximal and Maximum Transitive Relation Contained in a Given Binary Relation
From MaRDI portal
Publication:3196418
DOI10.1007/978-3-319-21398-9_46zbMath1465.68200arXiv1805.08953OpenAlexW2293228780MaRDI QIDQ3196418
Nitesh Jha, Shamik Ghosh, Sourav Chakraborty, Sasanka Roy
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.08953
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Node-and edge-deletion NP-complete problems
- Multiplying matrices faster than coppersmith-winograd
- An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
- A transitive closure algorithm
- The Transitive Reduction of a Directed Graph
- A Theorem on Boolean Matrices
This page was built for publication: Maximal and Maximum Transitive Relation Contained in a Given Binary Relation
