Parameterized linear time transitive closure
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- A linear-time algorithm for the perfect phylogeny haplotype problem
- A linear-time parameterized algorithm for computing the width of a DAG
- A new framework for hierarchical drawings
- Algorithms and bounds for drawing directed graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An improved algorithm for transitive closure on acyclic digraphs
- Beating matrix multiplication for \(n^{1/3}\)-directed shortcuts
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers
- Faster fully dynamic transitive closure in practice
- Gaussian elimination is not optimal
- Haplotyping with missing data via perfect path phylogenies
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3635493 (Why is no real title available?)
- Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
- More asymmetry yields faster matrix multiplication
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- Sparse dynamic programming on DAGs with small width
- Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
This page was built for publication: Parameterized linear time transitive closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357270)
