Generation and enumeration of some classes of interval orders
From MaRDI portal
Publication:2376909
DOI10.1007/S11083-012-9269-XzbMATH Open1282.06004DBLPjournals/order/DisantoPPR13OpenAlexW2066029851WikidataQ60692018 ScholiaQ60692018MaRDI QIDQ2376909FDOQ2376909
Authors: Filippo Disanto, E. Pergola, R. Pinzani, S. Rinaldi 
Publication date: 26 June 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-012-9269-x
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intransitive indifference with unequal indifference intervals
- Interval graphs and interval orders
- Generating functions for generating trees
- Intransitive Indifference in Preference Theory: A Survey
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
- ECO:a methodology for the enumeration of combinatorial objects
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- An obvious proof of Fishburn's interval order theorem
- A characterization of \((3+1)\)-free posets
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Height counting of unlabeled interval and \(N\)-free posets.
- Title not available (Why is that?)
- Counting interval orders
- A linear time and space algorithm to recognize interval orders
- Interval orders based on weak orders
Cited In (5)
Uses Software
This page was built for publication: Generation and enumeration of some classes of interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376909)
