N-free posets as generalizations of series-parallel posets (Q1097286): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / 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: Maximal chains and antichains / 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: Q3856672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordres "C.A.C." / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A labeling algorithm to recognize a line digraph and output its root graph / 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: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank

Latest revision as of 13:31, 18 June 2024

scientific article
Language Label Description Also known as
English
N-free posets as generalizations of series-parallel posets
scientific article

    Statements

    Identifiers