NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.072 seconds)

Spelling suggestions: "subject:"constar search algorithm"" "subject:"borstar search algorithm""

1

Enumerating Approximate Maximal Cliques in a Distributed Framework

Dhanasetty, Abhishek 05 October 2021 (has links)
No description available.
Computer Science
Approximate Maximal Cliques
A-star search algorithm
Triangle Enumeration
Heuristics
Degree Distribution
Clustering Coefficient

Page generated in 0.0764 seconds