论文信息 - Finding Large Holes

Finding Large Holes

Abstract This paper presents an algorithm that determines whether an undirected graph has any holes of size at least k in O(nk−3M), where M is the time required to multiply two n by n matrices.

Jeremy P. Spinrad

[1] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.

[2] Jeremy P. Spinrad,et al. On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[3] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[4] Liping Sun. Two classes of perfect graphs , 1991, J. Comb. Theory, Ser. B.

[5] Anna Lubiw. A note on odd/even cycles , 1988, Discret. Appl. Math..

[6] G. Dirac. On rigid circuit graphs , 1961 .

[7] Ryan B. Hayward,et al. Weakly triangulated graphs , 1985, J. Comb. Theory B.

[8] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..