NDLTD logo NDLTD Union Catalog and Global ETD Search

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 20 of 93 for “"Clique"”.

  1. Coloring clique hypergraphs

    Poon, Hoifung2019

    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 …

    wvu Repository record

  2. Maximum Clique in Geometric Intersection Graphs

    Espenant, JaredUniversity of Saskatchewan2023

    … to the items that intersect. The maximum clique in a geometric intersec- tion graph is the largest mutually intersecting set of objects. In this thesis, the primary focus is to study the maximum clique in various geometric intersection graphs. We develop three results motivated by the …

    sask Repository record

  3. Clique-based algorithms for protein structure prediction

    Dukka Bahadur K.C.京都大学 (Kyoto University)2006

    kyoto Repository record

  4. The Structure and Properties of Clique Graphs of Regular Graphs

    Burmeister, Jan2014

    … structure and properties of <em>G </em>and its clique graph <em>cl</em><sub><em>t</em></sub><em> </em>(<em>G</em>) are analyzed for graphs <em>G </em>that are non-complete, regular with degree <em>δ </em>, and where every edge of <em>G </em>is contained in a <em>t </em>-clique. In a clique graph …

    usm Repository record

  5. Clique here : exploring the use of mobile multi-media to support connectedness

    Corral, Joseph Edmund, 1980-Massachusetts Institute of Technology2004

    … expressiveness, overhead, and social obligation. Clique Here is a mobile communications platform that attempts to address this limitation and support a higher degree of social-connectedness by complementing mobile telephone capability with media rich awareness and multiple lightweight …

    mit Repository record

  6. Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs

    Wellens, Jake(Jake Lee)Massachusetts Institute of Technology2020

    … of De Caen, Erdős, Pullman and Wormald on clique partitions of a graph and its complement, building on ideas of Keevash and Sudakov.

    mit Repository record

  7. A Clique Analysis of the Effect of Proximity Upon Communication Structureand Interpersonal Relationships for Permanent and Non-Permanent College Staff Members

    Anderson, Norma BrandonUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-08T21:23:46Z (GMT). No. of bitstreams: 1 6607704.pdf: 5566149 bytes, checksum: 6ddc29da5d597b09b61c98c93ef540c7 (MD5) Previous issue date: 1966

    uiuc Repository record

  8. Tuning In: Nationalist Radio in China, 1928–1937

    Moriarty, William JosephUniversity of Cambridge2022

    … revolutionaries within the party called the CC Clique, whose belief in scientism led them to place radio broadcasting at the centre of the party state. During the Nanjing Decade (1928–1937), the CC Clique employed radio as both a tool of governance to promote political tutelage and a weapon of …

    cambridge Repository record

  9. Cohesive Subgraph Computation in Graphs

    Zhang, ChenUNSW, Sydney2020

    … 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

  10. Hypergraph Distributed Optimization & Decentralized Control with Applications in Economic Networks and Graphical Games

    Papastaikoudis, IoannisUniversity of Cambridge2024

    … hypergraphs instead of their graph analogue, the clique expansion graphs in the settings of distributed optimization and decentralized control. In both settings we present results where the use of hypergraphs provides a scalable and a decentralized way for consistently better convergence rate. …

    cambridge Repository record

  11. Reducibility and Statistical-Computational Gaps from Secret Leakage

    Brennan, Matthew S.Massachusetts Institute of Technology2021

    … common starting hardness assumption of planted clique (PC). The insight in this work is that a slight generalization of the planted clique conjecture – secret leakage planted clique (PCₚ), wherein a small amount of information about the hidden clique is revealed – gives rise to a variety of new …

    mit Repository record

  12. Average-case complexity of detecting cliques

    Rossman, Benjamin (Benjamin E.)Massachusetts Institute of Technology2010

    … is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain models of computation, solving k-CLIQUE in the average case requires Q(nk/4) resources (moreover, k/4 is tight). Here the models of computation are bounded-depth Boolean circuits …

    mit Repository record

  13. Institutional Investor Cliques Information Dissemination, and the Value of Information: Evidence from Insider Trading

    Zhang, ZhenyuVirginia Tech2023

    … formation of the institutional investor groups (cliques) that exogenously connect firm-level insiders within the social network. Using difference-in-differences designs examining changes in clique size, I provide empirical evidence on the information dissemination channels within a network in …

    vt Repository record

  14. Identifying word categories for diffusion studies in an email social network

    Choe, Timothy (Timothy S.)Massachusetts Institute of Technology2006

    … everyday", "common - specialized", "event", and "clique" words. Common - everyday words exhibit no diffusive or informative characteristics and are used regularly in everyday communication. Common - specialized words also exhibit no diffusive characteristics, but are hypothesized to be specialized …

    mit Repository record

  15. Emotional Social Networks and Interpersonal Communication of Emerging Adults

    Tomlin, Peter RobertDurham University2011

    … their intimate social relationships (the support clique and sympathy group), usage of technology for communication, and personality according to the Five Factor Model of the respondents. This study found support clique sizes of 6.44 ± 3.22 and sympathy group sizes of 14.31 ± 7.06, with female …

    durham Repository record

  16. Upper and lower bounds for the fixed spectrum frequency assignment problem

    Montemanni, Robert2001

    … lower bounds calculated for some of its clique-like subproblems are presented. The key idea is that it is quite easy to calculate tight lower bounds for problems represented by complete graphs (cliques). The lower bounds for clique-like subproblems are produced by two different methods, …

    southwales Repository record

  17. Meta State Generalized Hidden Markov Model for Eukaryotic Gene Structure Identification

    Baribault, Carl

    Using a generalized-clique hidden Markov model (HMM) as the starting point for a eukaryotic gene finder, the objective here is to strengthen the signal information at the transitions between coding and non-coding (c/nc) regions. This is done by enlarging the primitive hidden states associated with …

    uno Repository record

  18. Bridging Theory and Practice in Parallel Clustering

    Shi, JessicaMassachusetts Institute of Technology2023

    … of small subgraphs, including small cycles and cliques, which has applications in clustering metrics and graph statistics. We design new theoretically efficient parallel algorithms for exact and approximate butterfly (four-cycle), five-cycle, and k-clique counting, and demonstrate significant …

    mit Repository record

  19. Forbidden Substructures in Graphs and Trigraphs, and Related Coloring Problems

    Penev, Irena2012

    … the chromatic number of G, and ω(G) denotes the clique number of G (i.e. the maximum number of pairwise adjacent vertices in G). A graph G is perfect provided that for every induced subgraph H of G, χ(H) = ω(H). This thesis addresses several problems from the theory of perfect graphs and …

    columbia-diss Repository record

  20. Extremal graph theory: supersaturation and enumeration

    Liu, HongUniversity of Illinois at Urbana-Champaign2016

    … on the typical structure of graphs forbidding a clique of fixed order as a subgraph, showing that the order of the forbidden clique can be as large as some polylogarithmic function of the order of the host graph. This is based on joint work with Balogh, Bushaw, Collares Neto, Morris and …

    uiuc Repository record

Page 1 of 5