Average-case complexity of detecting cliques
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Main Author: | Rossman, Benjamin (Benjamin E.) |
---|---|
Other Authors: | Madhu Sudan. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/62441 |
Similar Items
-
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
by: Boix-Adsera, Enric, et al.
Published: (2021) -
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
by: Boix-Adserà, Enric, et al.
Published: (2022) -
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2024) -
Clique here : exploring the use of mobile multi-media to support connectedness
by: Corral, Joseph Edmund, 1980-
Published: (2005) -
Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
by: Ni, Peng
Published: (2021)