𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weak and strong fuzzy interval orders

✍ Scribed by Bernard De Baets; Bartel Van de Walle

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
895 KB
Volume
79
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interval orders based on weak orders
Interval orders based on weak orders
✍ Kenneth P. Bogart; Joseph Bonin; Jutta Mitas πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 338 KB
Interval graphs and interval orders
Interval graphs and interval orders
✍ Peter C. Fishburn πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 949 KB

This paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially

Similarity relations, fuzzy linear order
Similarity relations, fuzzy linear orders, and fuzzy partial orders
✍ Sukhamay Kundu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 230 KB

We show that for a fuzzy partial order R on a ΓΏnite universe , there is a ΓΏnite family of fuzzy linear orders {Li: 16i6k} such that R(x; y) = min{ L i (x; y): 16i6k} for all x and y. This generalizes a well-known result on crisp partial orders, which states that each partial order on a ΓΏnite set is

Combinatorial Aspects of Interval Orders
Combinatorial Aspects of Interval Orders and Interval Graphs
✍ William T. Trotter πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 28 KB

We survey recent research on combinatorial properties of interval orders and interval graphs. Topics include: optimization with an uncooperative partner, ramsey trails, sorting with partial information, tree width and graph decompositions, combinatorial extremal problems, shift graphs, Dedekind's en