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 8 of 8 for “"Maximal clique enumeration"”.

  1. Maximal Clique Enumeration and Related Tools for Microarray Data Analysis

    … study was to investigate the utility of exact maximal clique enumeration in DNA microarray analysis, to analyze and improve upon existing exact maximal clique enumeration algorithms, and to develop new clique-based algorithms to assist in the analysis as indicated during the course of the …

    ut-knoxville Repository record for Maximal Clique Enumeration and Related Tools for Microarray Data Analysis (opens in a new tab)

  2. Mining dense substructures from large deterministic and probabilistic graphs

    … the two most fundamental dense substructures are Maximal Cliques and Maximal Bicliques. The enumeration of both these structures are central to many data mining problems. With the advent of “big data”, real world graphs have become massive. Recently systems like MapReduce have evolved to process …

    iastate Repository record for Mining dense substructures from large deterministic and probabilistic graphs (opens in a new tab)

  3. Mining maximal cliques from large graphs using MapReduce

    <p>Maximal clique enumeration (MCE), a fundamental task in graph analysis, can help identify dense substructures within a graph, and has found applications in graphs arising in biological and chemical networks, and more. While MCE is well studied in the sequential case, a single machine can no …

    iastate Repository record for Mining maximal cliques from large graphs using MapReduce (opens in a new tab)

  4. Scalable Graph Algorithms with Applications in Genetics

    … and genomic analysis. In particular, enumeration problems such as maximal clique and maximal biclique finding are cores for addressing many biological problems, such as the integration of genome mapping data. However, the enumeration problems may become computation and memory bot- …

    utk-theses Repository record for Scalable Graph Algorithms with Applications in Genetics (opens in a new tab)

  5. Simulation and modeling of networks targeting graph attributes and structures

    … edges over time. We study the distribution of maximal clique sizes in graphs generated by the preferential attachment model. Our goal is to preserve average maximal clique size over time. We determine the parameterizations of the preferential attachment model that achieve this goal and we …

    manitoba Repository record for Simulation and modeling of networks targeting graph attributes and structures (opens in a new tab)

  6. 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 …

    unsw Repository record for Cohesive Subgraph Computation in Graphs (opens in a new tab)

  7. I/O efficient cohesive subgraph search in large graphs

    … respect to the I/O efficiency: diversified top-k clique search, edge connected component decomposition and Steiner component search. Firstly, we investigate the I/O efficient algorithm for diversified top-k clique search problem. We devise an algorithm to maintain k candidates in the process of …

    unsw Repository record for I/O efficient cohesive subgraph search in large graphs (opens in a new tab)

  8. High Performance Large Graph Analytics by Enhancing Locality

    … for three graph problems: k-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.

    odu Repository record for High Performance Large Graph Analytics by Enhancing Locality (opens in a new tab)