Optimal Algorithm of Isolated Toughness for Interval Graphs

Abstract

Factor and fractional factor are widely used in many fields related to computer science. The isolated toughness of an incomplete graph G is defined as iτThis parameter has a close relationship with the existence of factors and fractional factors of graphs. In this paper, we pay our attention to computational complexity of isolated toughness, and present an optimal polynomial time algorithm to compute the isolated toughness for interval graphs, a subclass of cocomparability graphs.

Analysis of Drift Tool Selection

“…In turn, we let the slow start first, and in a certain amount of time, the slow can not catch up with the fast. The distance between slow and fast will become longer and longer, and certain camps will be left unused [3].…”

“…Using MATLAB to get the results of the calculation, get all the trip tourists occupied the largest number of camps [3]:…”

Polynomial algorithms for computing the isolated toughness of interval and split graphs

“…We start the following section by recalling some additional terminology and stating some elementary results that we will use in our considerations. A preliminary version of this article appeared in the Proceeding of the 21th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2020) 11 …”