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 29 for “"independent sets"”.
-
On Maximum Weight Independent Sets and the Set Partitioning Problem
Made available in DSpace on 2014-12-14T13:09:44Z (GMT). No. of bitstreams: 1 8009103.pdf: 2080632 bytes, checksum: 8b27f27acb1dd7e80416171889173a3d (MD5) Previous issue date: 1979
-
Contributions on secretary problems, independent sets of rectangles and related problems
… accept it or not, while keeping the accepted set independent in the matroid. The goal is to maximize the expected weight of our solution. We study different variants for this problem depending on how the elements are presented and on how the weights are assigned to the elements. Our main result is …
-
Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs
… graph theory with respect to edge-colorings, independent sets, and cycle spectra. In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree. In Chapter 4, we study a Ramsey-type problem on edge-labeled trees, where we seek subtrees …
-
Efficient Setup Algorithms for Parallel Algebraic Multigrid
… itself. A new algorithm labeled Bucket Sorted Independent Sets (BSIS) is developed and contributes two major advances. First, the cost of selecting independent sets while coarsening is substantially less expensive, with experiments demonstrating 23% savings over CLJP-c. Second, theory is …
-
Independence Polynomials of Molecular Graphs
… certain molecules were related to the number of independent vertex sets in the molecular graphs of those chemicals. This led to the definition of the Merrifield-Simmons index of a graph G as the number of independent vertex sets in G. This parameter was extended by graph theorists, who counted …
-
Efficient Computation of Extremal Structures in Graphs and Hypergraphs
… consists of a ground set and a collection of subsets of the ground set called independent sets with the property that any subset of an independent set is independent. We study the problem of computing a maximal independent set (mis) in an independence system. We propose two approaches for …
-
Independent Domination Of Subcubic Graphs
Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of …
-
Extremal problems on counting combinatorial structures
… results on characterizing of the structure of independent sets in hypergraphs. This is a joint work with J\'{o}zsef Balogh. In Chapter 3, we investigate the structure of maximal triangle-free graphs. We prove that almost all maximal triangle-free graphs admit a vertex partition $(X, Y)$ such …
-
Well-covered Graphs, Unique Colorability, and Covering Range
… is called well-covered if all of its maximal independent sets have the same cardinality. We give a characterization of well-covered k-trees. A graph is said to be uniquely χ-colorable if, modulo permutations of colors, it has exactly one proper χ-coloring. The k-trees with at least k+1 …
-
Local computation algorithms for graphs of non-constant degrees
… we give randomized LCAs for computing maximal independent sets, maximal matchings, and approximate maximum matchings. Both time and space complexities of our LCAs on these problems are 2 0(log3 d)polylog(n), 2 0(log2 d)polylog(n) and 2 0(log3 d)polylog(n), respectively.
-
A Coupled Heat Transfer and Electromagnetic Model for Simulating Microwave Heating of Thin Dielectric Materials in a Resonant Cavity
… simulation is validated by comparison to several independent sets of experimental data. The ultimate goal is to provide a research tool that will facilitate the industrial microwave applicator design process. With a complete, accurate, and user-friendly numerical simulation, parameters affecting …
-
Processing Phenomena and the Dissociation Between Subjective and Objective Workload Measures (Cognition, Automaticity, Verbal Reports)
… task performance was manipulated by using two independent sets of stimuli; one of which was consistently mapped (i.e., targets were always the same) while the other was inconsistently mapped (i.e., targets changed over trials). Also, all Sternberg configurations were performed both as single …
-
Forbidden substructures: induced subgraphs, Ramsey games, and sparse hypergraphs
… graph has a vertex partition into k cliques and independent sets and provide a characterization. Such graphs contain homogeneous sets of size linear in the number of vertices, and so this result provides a strong partial result toward proving the Erdos-Hajnal conjecture. In Chapter 3, we study a …
-
Parallel algorithms for scheduling data-graph computations
… scheduling. Using a vertex-coloring to identify independent sets of vertices, which may be safely processed in parallel, Prism serializes through the colors and processes the independent sets in parallel, thus executing data-graph computations deterministically and without the use of costly …
-
Cluster assignment and instruction scheduling for partitioned register-set machines
… solution is to partition the register file into independent sets and associate each functional unit with a specific register set. Such partitioned register sets have appeared in a number of commercial machines, such as Texas Instruments TMS320C6xxx DSP chips. Partitioned register-set …
-
Poisson structures and degenerations of integrable systems related to y (gl2)
… the past, these three systems were studied using independent sets of variables. Since we can express any system corresponding to such k using the same set of variables (τ-functions), we prove that all these systems are in fact isomorphic to the Toda system, and hence to each other. This seems not …
-
Exploring The Universe With The Atacama Cosmology Telescope: Polarization-Sensitive Measurements Of The Cosmic Microwave Background
… and polarization. The receiver features three independent sets of cryogenically cooled optics coupled to transition-edge sensor (TES) based polarimeter arrays via monolithic silicon feedhorn stacks. The three detector arrays, two operating at 149 GHz and one operating at both 97 and 149 GHz, …
-
The Structure and Properties of Clique Graphs of Regular Graphs
… of whether a clique graph can have a large independent set is considered (independent sets in regular graphs can be composed of half the vertices in the graph at the most). In particular, the relation between the degree difference and the independence number of …
-
On K-trees and Special Classes of K-trees
… exceeding one. Let fs = fs( G) be the number of independent sets of cardinality s of G. Then the polynomial I(G; x) = [special characters omitted] fs(G)x s is called the independence polynomial. All rational roots of the independence polynomials of paths are found, and the exact paths whose …
-
Vertex enumeration and counting for certain classes of polyhedra
… of polyhedra associated with 0-1 Permanent, Down Sets, Independent Sets, 0-1 Knapsack Problems, 2 by n transportation problems, matroids and matchings in a non-bipartite graph are developed.
Page 1 of 2