Short Models for Unit Interval Graphs
نویسندگان
چکیده
We present one more proof of the fact that the class of proper interval graphs is precisely the class of unit interval graphs. The proof leads to a new and efficient O(n) time and space algorithm that transforms a proper interval model of the graph into a unit model, where all the extremes are integers in the range 0 to O(n2), solving a problem posed by Gardi (Discrete Math., 307 (22), 2906–2908, 2007).
منابع مشابه
A short proof that 'proper = unit'
A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations. An graph is an interval graph if its vertices can be assigned intervals on the real line so that vertices are adjacent if and only if the corresponding intervals intersect; such an assignment is an interval representation. When the intervals have the same le...
متن کاملOverview and Comparison of Short-term Interval Models for Financial Time Series Forecasting
In recent years, various time series models have been proposed for financial markets forecasting. In each case, the accuracy of time series forecasting models are fundamental to make decision and hence the research for improving the effectiveness of forecasting models have been curried on. Many researchers have compared different time series models together in order to determine more efficien...
متن کاملBounded, minimal, and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملMinimal and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملBounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . In the bounded version,M is given together with some lower and upper bounds that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 35 شماره
صفحات -
تاریخ انتشار 2009