Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the greedy dimension of a partial order / 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: On some complexity properties of N-free posets and posets with bounded decomposition diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / 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 / cites work
 
Property / cites work: Q3676161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some new types of greedy chains and greedy linear extensions of partially ordered sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:53, 18 June 2024

scientific article
Language Label Description Also known as
English
Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
scientific article

    Statements

    Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (English)
    0 references
    0 references
    1987
    0 references
    0 references
    arc diagrams of posets
    0 references
    jump number problem
    0 references
    N-free posets
    0 references
    greedy chains
    0 references