A linear-time parameterized algorithm for computing the width of a DAG (Q2672441): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the perfect phylogeny haplotype problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line chain partitions of orders: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking existential logic on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear dynamic analysis of the viscoelastic string with a harmonically varying transport speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing setups in ordered sets of fixed width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition algorithms for orders of small width and graphs of small Dilworth number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haplotyping with missing data via perfect path phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological sorting of large networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Reduction for Maximum Matching on Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Dynamic Programming on DAGs with Small Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Combinatorics / rank
 
Normal rank

Latest revision as of 06:05, 29 July 2024

scientific article
Language Label Description Also known as
English
A linear-time parameterized algorithm for computing the width of a DAG
scientific article

    Statements

    A linear-time parameterized algorithm for computing the width of a DAG (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    directed acyclic graph
    0 references
    maximum antichain
    0 references
    DAG width
    0 references
    posets
    0 references
    parameterized algorithms
    0 references
    reachability queries
    0 references
    0 references

    Identifiers