Document Type

Article

Publication Date

1993

DOI

10.1016/0898-1221(93)90308-i

Publication Title

Computers & Mathematics with Applications

Volume

25

Issue

7

Pages

15-25

Abstract

A fundamental problem in social sciences and management is understanding and predicting decisions made by individuals, various groups, or the society as a whole. In this context, one important concept is the notion of indifference. We characterize the class of indifference graphs, that is, graphs which arise in the process of quantifying indifference relations. In particular, we show that these graphs are characterized by the existence of a special ordering of their vertices. As it turns out, this ordering leads naturally to optimal greedy algorithms for a number of computational problems, including coloring, finding a shortest path between two vertices, computing a maximum matching, the center, and a Hamiltonian path.

Comments

Elsevier open archive. Copyright © 1993 Published by Elsevier Ltd. All rights reserved.

Original Publication Citation

Looges, P. J., & Olariu, S. (1993). Optimal greedy algorithms for indifference graphs. Computers & Mathematics with Applications, 25(7), 15-25. doi:10.1016/0898-1221(93)90308-i

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS