Indifference Graphs and the Single Row Routing Problem
Date of Award
Master of Science (MS)
Charles Michael Overstreet
James L. Schwing
Call Number for Print
Special Collections LD4331.C65L66
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Looges, Peter J..
"Indifference Graphs and the Single Row Routing Problem"
(1991). Master of Science (MS), Thesis, Computer Science, Old Dominion University, DOI: 10.25777/tazm-6q94