Efficient algorithms for clique problems-Reference-Cited by-同舟云学术

Efficient algorithms for clique problems

Published:2009-01 Issue:4 Volume:109 Page:254-257
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Vassilevska Virginia

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference22 articles.

1. Color-coding;Alon;J. ACM,1995

2. Finding and counting given length cycles;Alon;Algorithmica,1997

3. On economical construction of the transitive closure of an oriented graph;Arlazarov;Soviet Math. Dokl.,1970

4. J. Basch, S. Khanna, R. Motwani, On diameter verification and boolean matrix multiplication, Report No. STAN-CS-95-1544, Department of Computer Science, Stanford University, 1995

5. T.M. Chan, All-pairs shortest paths for unweighted undirected graphs in o(mn) time, in: Proc. SODA, 2006, pp. 514–523

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semantic community query in a large‐scale attributed graph based on an attribute cohesiveness optimization strategy;Expert Systems;2024-08-14

2. Enhanced molecular docking: Novel algorithm for identifying highest weight k-cliques in weighted general and protein-ligand graphs;Journal of Molecular Structure;2024-05

3. Faster Combinatorial k-Clique Algorithms;Lecture Notes in Computer Science;2024

4. A post-quantum associative memory;Journal of Physics A: Mathematical and Theoretical;2023-10-13

5. On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18