On-line algorithms for orders
From MaRDI portal
Publication:1392200
DOI10.1016/S0304-3975(97)00200-4zbMath0903.68084MaRDI QIDQ1392200
Jean-Xavier Rampon, Vincent Bouchitte
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The jump number and the lattice of maximal antichains
- A linear-time recognition algorithm for interval dags
- Computing on-line the lattice of maximal antichains of posets
- The number of Moore families on \(n=6\)
- Topology of series-parallel networks
- Betweenness, orders and interval graphs
- Calcul des idéaux d'un ordonné fini
- A Linear Recognition Algorithm for Cographs
- The Recognition of Series Parallel Digraphs
- An Effective Version of Dilworth's Theorem
- Time, clocks, and the ordering of events in a distributed system
- On-line computations of the ideal lattice of posets
This page was built for publication: On-line algorithms for orders
