Minimizing the sum cost in linear extensions of a poset (Q630194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: NP-completeness properties about linear extensions / 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: Q4200070 / 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: Minimizing bumps in linear extensions of ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing jumps for ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump number of Z-free ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy posets for the bump-minimizing problem / rank
 
Normal rank

Latest revision as of 21:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the sum cost in linear extensions of a poset
scientific article

    Statements

    Identifiers