Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Maximal Clique"”.
-
Coloring clique hypergraphs
Let G = (V, E) be a simple graph. The clique hypergraph of G, denoted as CH( G), has V as its set of vertices, and the maximal cliques as its hyperedges. Let Sk be a set of k colors. A map c : V Sk is a proper k-coloring for CH(G) if any maximal clique of G with at least two vertices receives at …
-
Cohesive Subgraph Computation in Graphs
… Firstly, we study the problem of spatial clique enumeration. Maximal clique enumeration is a fundamental problem in graph database. In this chapter, we investigate this problem in the context of spatial database. We give the definition of clique on spatial graph and propose a backtracking …
-
Leaders, followers, and community detection
… overlapping vertices. Formally, we view any maximal clique of the social network graph as a community. The problem of finding maximal cliques is known to be computationally hard. The goal of this work is to identify structural conditions in social network graphs that lead to efficient …
-
High Performance Large Graph Analytics by Enhancing Locality
… graph problems: <em>k-</em>core decomposition, maximal clique enumeration and triangle listing. We have implemented the algorithms. The results show that these algorithms provide significant improvement in performance and also scale well.</p>
-
Accelerating graph pattern mining algorithms on modern graphics processing units
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms
-
Slot-Exchange Mechanisms and Weather-Based Rerouting within an Airspace Planning and Collaborative Decision-Making Model
… further tighten the model representation using maximal clique cover-based cuts that relate to the joint compatibility among the individual package-deals. The second approach significantly improves the overall model efficiency by automatically generating package-deals as required within the APCDM …