Finding maximum cliques on circular-arc graphs

TL;DR: It turns out that these chordal graphs that are orientable as local tournaments are precisely the graphs previously studied as proper circular arc graphs, i.e., that are proper circularArc graphs.

TL;DR: An efficient algorithm for generating all maximum independent sets of a bipartite graph with time complexity O(n2.5 + (output size)), where n is the number of vertices of a given graph.

TL;DR: On considere des graphes pour lesquels il existe une correspondance bijective de l'ensemble des sommets avec une famille d'arcs circulaires sur le cercle unite, et presente des algorithmes paralleles and optimaux concernant quelques ensembles caracteristiques de ces graphes.

TL;DR: It is pointed out that convex-round and concave-round graphs can be recognized in O(n+m) time (here n denotes the number of vertices and m thenumber of edges of the graph in question).

TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.

TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.

TL;DR: This note shows that the second objection can be amended by combining some ideas used before in [2], and the present and previous results are expressed by the following lemma’s and theorem.

TL;DR: This paper investigates simulations of tree machines; the fact that divide-and-conquer algorithms are programmed naturally on trees motivates the investigation, and constructs a universal bounded-degree network on N nodes for which every N node binary tree is a spanning tree.