A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Nicolae Tandareanu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Nicolae Tandareanu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump number of dags having Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200070 / 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: Minimizing Setups for Cycle-Free Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy linear extensions to minimize jumps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Approaches to Setup Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the jump number for partially ordered sets: A graph-theoretic approach / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00340778 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073598086 / rank
 
Normal rank

Latest revision as of 10:11, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
scientific article

    Statements

    A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    The authors present a linear algorithm for solving the jump number problem in 2-dimensional bipartite posets.
    0 references
    linear algorithm
    0 references
    jump number problem
    0 references
    2-dimensional bipartite posets
    0 references

    Identifiers