𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recognition algorithm for orders of interval dimension two

✍ Scribed by Larry J. Langley

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
500 KB
Volume
60
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bound on the dimension of interval ord
A bound on the dimension of interval orders
✍ K.P Bogart; Issie Rabinovich; W.T Trotter Jr. πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 605 KB
Path orders of global dimension two
Path orders of global dimension two
✍ A Wiedemann; K.W Roggenkamp πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 933 KB
A linear time recognition algorithm for
A linear time recognition algorithm for proper interval graphs
✍ B.S. Panda; Sajal K. Das πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 128 KB

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian

A Robinson–Schensted Algorithm for a Cla
A Robinson–Schensted Algorithm for a Class of Partial Orders
✍ Thomas S. Sundquist; David G. Wagner; Julian West πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 378 KB

Let P be a finite partial order which does not contain an induced subposet isomorphic with 3+1, and let G be the incomparability graph of P. Gasharov has shown that the chromatic symmetric function X G has nonnegative coefficients when expanded in terms of Schur functions; his proof uses the dual Ja