Abstract. We use the notion of handle, introduced by Hayward, to improve algorithms for weakly chordal graphs. For recognition we reduce the time complexity ...

We use the notion of handle, introduced by Hayward, to improve algorithms for weakly chordal graphs. For recognition we reduce the time complexity from ...

Contents. SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. Weakly chordal graph algorithms via handles. Pages 42 - 49 ...

A graph is weakly chordal if every connected induced subgraph H that is not a complete graph, contains a 2-pair. A graph is weakly chordal if it is (anti-hole, ...

Abstract. We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the recognition problem, ...

This thesis is in the field of graph algorithms. Our focus is to recognize the class of weakly chordal graphs, which are graphs with a special given structure.

A new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms that reduce the time complexity and space ...

A graph is weakly chordal if neither the graph nor the complement of the graph has an induced cycle on five or more vertices. In this paper, we show that a ...

Graph isomorphism completenes for chordal bipartite graphs and strongly chordal graphs ... Weakly chordal graph algorithms via handles. Proc. of the 11th ...

In this paper, we show that when G is weakly chordal, the size of the largest induced matching in G is equal to the minimum number of co-chordal subgraphs of G ...