Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Computer Sciences
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Computer Science Theses & Dissertations
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.