Optimal greedy algorithms for indifference graphs

Investigates the class of indifference graphs that models the notion of indifference relation arising in social sciences and management. The authors examine algorithmic properties of indifference graphs. Recently it has been shown that indifference graphs are characterized by a very special ordering on their sets of vertices. It is shown that this linear order can be exploited in a natural way to obtain optimal greedy algorithms for a number of computational problems on indifference graphs, including finding a shortest path between two vertices, computing a maximum matching, the center, and a Hamiltonian path.<>