• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 761
  • 105
  • 70
  • 58
  • 24
  • 24
  • 16
  • 16
  • 16
  • 16
  • 16
  • 16
  • 14
  • 10
  • 7
  • Tagged with
  • 1400
  • 1400
  • 293
  • 201
  • 154
  • 149
  • 124
  • 122
  • 121
  • 121
  • 120
  • 115
  • 109
  • 108
  • 107
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
231

Path Graphs and PR-trees

Chaplick, Steven 20 August 2012 (has links)
The PR-tree data structure is introduced to characterize the sets of path-tree models of path graphs. We further characterize the sets of directed path-tree models of directed path graphs with a slightly restricted form of the PR-tree called the Strong PR-tree. Additionally, via PR-trees and Strong PR-trees, we characterize path graphs and directed path graphs by their Split Decompositions. Two distinct approaches (Split Decomposition and Reduction) are presented to construct a PR-tree that captures the path-tree models of a given graph G = (V, E) with n = |V| and m = |E|. An implementation of the split decomposition approach is presented which runs in O(nm) time. Similarly, an implementation of the reduction approach is presented which runs in O(A(n + m)nm) time (where A(s) is the inverse of Ackermann’s function arising from Union-Find [40]). Also, from a PR-tree, an algorithm to construct a corresponding Strong PR-tree is given which runs in O(n + m) time. The sizes of the PR-trees and Strong PR-trees produced by these approaches are O(n + m) with respect to the given graph. Furthermore, we demonstrate that an implicit form of the PR-tree and Strong PR-tree can be represented in O(n) space.
232

Path Graphs and PR-trees

Chaplick, Steven 20 August 2012 (has links)
The PR-tree data structure is introduced to characterize the sets of path-tree models of path graphs. We further characterize the sets of directed path-tree models of directed path graphs with a slightly restricted form of the PR-tree called the Strong PR-tree. Additionally, via PR-trees and Strong PR-trees, we characterize path graphs and directed path graphs by their Split Decompositions. Two distinct approaches (Split Decomposition and Reduction) are presented to construct a PR-tree that captures the path-tree models of a given graph G = (V, E) with n = |V| and m = |E|. An implementation of the split decomposition approach is presented which runs in O(nm) time. Similarly, an implementation of the reduction approach is presented which runs in O(A(n + m)nm) time (where A(s) is the inverse of Ackermann’s function arising from Union-Find [40]). Also, from a PR-tree, an algorithm to construct a corresponding Strong PR-tree is given which runs in O(n + m) time. The sizes of the PR-trees and Strong PR-trees produced by these approaches are O(n + m) with respect to the given graph. Furthermore, we demonstrate that an implicit form of the PR-tree and Strong PR-tree can be represented in O(n) space.
233

The problem of coexistence in multi-type competition models /

Kordzakhia, George. January 2003 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Statistics, August 2003. / Includes bibliographical references. Also available on the Internet.
234

ProGENitor : an application to guide your career

Hauptli, Erich Jurg 20 January 2015 (has links)
This report introduces ProGENitor; a system to empower individuals with career advice based on vast amounts of data. Specifically, it develops a machine learning algorithm that shows users how to efficiently reached specific career goals based upon the histories of other users. A reference implementation of this algorithm is presented, along with experimental results that show that it provides quality actionable intelligence to users. / text
235

On the complexity of finding optimal edge rankings

余鳳玲, Yue, Fung-ling. January 1996 (has links)
published_or_final_version / abstract / toc / Computer Science / Master / Master of Philosophy
236

Efficient algorithms for broadcast routing

王慧霞, Wong, Wai-ha. January 1996 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
237

Polygon reconstruction from visibility information

Jackson, LillAnne Elaine, University of Lethbridge. Faculty of Arts and Science January 1996 (has links)
Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the visibilities around vertices is frequently added. The first section of this thesis extracts, in o(E) time, the Hamiltonian cycle that corresponds to the boundary of the polygon from the polygon's ordered visibility graph. Also, it converts an unordered visibility graph and Hamiltonian cycle to the ordered visibility graph for that polygon in O(E) time. The secod, and major result is an algorithm to reconstruct an arthogonal polygon that is consistent with the Hamiltonian cylce and visibility stabs of the sides of an unknown polygon. The algorithm uses O(nlogn) time, assuming there are no collinear sides, and )(n2) time otherwise. / vii, 78 leaves ; 28 cm.
238

On the detection of negative cycles in a graph

Shea, Dennis Patrick 05 1900 (has links)
No description available.
239

Independent trees in 4-connected graphs

Curran, Sean P. 08 1900 (has links)
No description available.
240

Unique coloring of planar graphs

Fowler, Thomas George 12 1900 (has links)
No description available.

Page generated in 0.0516 seconds