Using the ELCA Technique to Find R-cliques in a Graph Database
碩士 === 國立臺灣海洋大學 === 資訊工程學系 === 102 === Graph databases have been applied to represent complex data, and keyword search on graph databases is a convenient mechanism for users. However, the time complexity for keyword searching on a graph database is much higher than searching on tree databases. Ther...
Main Authors: | Yu-Kai Chang, 張祐愷 |
---|---|
Other Authors: | Ya-Hui Chang |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/63368965226625174999 |
Similar Items
-
Finding Top-K R-cliques in a Graph Database
by: Chang, Yu-En, et al.
Published: (2014) -
Finding all maximal cliques in dynamic graphs
by: Stix, Volker
Published: (2002) -
Finding k-cliques on a k-partite Graph
by: Jheng-Ming Yang, et al.
Published: (2005) -
Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
by: Alan Bojić
Published: (2012-12-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
by: Napur Patra, et al.
Published: (2021-06-01)