Showing papers in "Information Processing Letters in 2024"

TL;DR: In this paper , it was shown that the complexity of well-covered and well-dominated graphs is coNP-complete, which is the first time for a well-known open question.

TL;DR: In this paper , the authors provided a tight approximation ratio of 1.46 for three, four, and five processors, respectively, for the case when all the processors have different speeds.

TL;DR: In this paper , a simple algorithm was developed to solve the problem in O(n 2 ) time, however, there is an error in Corollary 1 and the proofs of Proposition 1 and CORCL 1 are not complete.

TL;DR: In this article , it was shown that the hull number of a 4-regular planar graph is at most half of its number of vertices and that such bound is tight.

TL;DR: In this article , the authors studied two variants of the maximum linear arrangement problem (MaxLA) which consists of finding an arrangement that maximizes the cost and proved that caterpillar trees maximize planar MaxLA over all trees of a fixed size.

TL;DR: In this paper , a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit is given, based on a simple condition of when two edges must appear consecutively in all Eulerians.