Jan 26, 2023 · In this article, we study the computational complexity of the transitivity problem in subclasses of chordal graphs. The organization and main ...

Nov 25, 2022 · For two disjoint subsets A and B of V, we say A \textit{dominates} B if every vertex of B is adjacent to at least one vertex of A in G.

Nov 25, 2022 · For two disjoint subsets A and B of V , we say A 2-dominates B if every vertex of B is adjacent to at least two vertices of A. A vertex ...

Feb 9, 2023 · The Maximum Transitivity Problem is to find a transitive partition of a given graph with the maximum number of partitions. It was known that the ...

Nov 25, 2022 · The Maximum Transitivity Problem is to find a transitive partition of a given graph with the maximum number of partitions. It was known that the ...

In this paper, we first prove that this problem can be solved in linear time for \emph{split graphs} and for the \emph{complement of bipartite chain graphs}, ...

The triangular matrix can be symmetrically permuted to minimize the number of factors over suitable classes of permutations, and thereby the complexity of ...

Chordal graphs play a central role in techniques for exploiting spar- sity in large semidefinite optimization problems and in related con-.

Jan 1, 2023 · We propose a linear-time algorithm for finding the transitivity of a given bipartite chain graph. We then characterize graphs with transitivity at least t for ...

Chordal graphs are a subset of the perfect graphs. They may be recognized in linear time, and several problems that are hard on other classes of graphs such as ...