NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 71
  • 5
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 97
  • 97
  • 97
  • 28
  • 24
  • 16
  • 12
  • 10
  • 9
  • 9
  • 8
  • 8
  • 8
  • 7
  • 7
  • 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.

Search results

Showing 31 to 40 of 97 (0.036 seconds)

Spelling suggestions: "subject:"trees (graph 1heory)"" "subject:"trees (graph btheory)""

31

The scaling limit of lattice trees above eight dimensions.

Derbez, Eric. Slade, G. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1996. / Source: Dissertation Abstracts International, Volume: 58-06, Section: B, page: 3071. Adviser: G. Slade.
32

An approximation algorithm for the maximum leaf spanning arborescence problem

Drescher, Matthew. January 1900 (has links)
Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/01/15). Includes bibliographical references.
33

Biodiversity conservation and evolutionary models : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in the University of Canterbury /

Hartmann, Klaas. January 2008 (has links)
Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (p. 181-193). Also available via the World Wide Web.
34

Combinatorial aspects of leaf-labelled trees : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, University of Canterbury Department of Mathematics and Statistics /

Humphries, Peter J. January 2008 (has links)
Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references and index. Also available via the World Wide Web.
35

Novel mathematical aspects of phylogenetic estimation : a thesis submitted in partial fulfillment of the requirements for the degree Doctor of Philosophy at the University of Canterbury /

Fischer, Mareike. January 1900 (has links)
Thesis (Ph. D.)--University of Canterbury, 2009. / Typescript (photocopy). Includes bibliographical references (p. 139-143) and index. Also available via the World Wide Web.
36

Generalized maximal independence parameters for trees /

Mercer, John, January 2001 (has links)
Thesis (M.Sc.)--Memorial University of Newfoundland, 2002. / Bibliography: leaves 69-70.
37

Path lengths of binary search trees

Tan, Kok-Chye, January 1971 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1971. / Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 79-80).
38

Bandwidth problems of graphs

Chan, Wai Hong 01 January 1996 (has links)
No description available.
Graph theory
Symmetric matrices
Trees (Graph theory)
39

Isomorphic vertex colorings of trees with two degree two vertices and maximum degree three

O'Leary, Georgie L. M. 01 July 2000 (has links)
No description available.
Graph theory
Trees (Graph theory)
Mathematics
40

Approximation algorithms for minimum-cost low-degree subgraphs

Könemann, Jochen. January 1900 (has links) (PDF)
Thesis (Ph. D.)--Carnegie Mellon University, 2003. / Title from PDF title page (viewed Dec. 18, 2009). Includes bibliographical references (p. 49-52).

Page generated in 0.0507 seconds