- 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 251 to 260 of 1400 (0.036 seconds)Spelling suggestions: "subject:"graphtheory."" "subject:"brand.theory.""
| 251 |
Efficient query processing on graph databases /Cheng, James Sheung-Chak. January 2008 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2008. / Includes bibliographical references (leaves 98-103). Also available in electronic version.
|
| 252 |
Trees and the implicit construction of eigenvalue multiplicity lists /Nuckols, Jonathan Edward. January 2008 (has links)
Thesis (Honors)--College of William and Mary, 2008. / Includes bibliographical references (leaf 39). Also available via the World Wide Web.
|
| 253 |
Pseudo-triangulations on closed surfacesPotter, John R. January 2008 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: Embeddings; graph theory; pseudo-triangulations. Includes bibliographical references (leaves 30-31).
|
| 254 |
Dual-Eulerian graphs with applications to VLSI designFreeman, Andre. January 2003 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: Dual Eulerian Graphs; VLSI. Includes bibliographical references (p. 170-171).
|
| 255 |
Automated discovery and proof in three combinatorial problemsRaff, Paul, January 2009 (has links)
Thesis (Ph. D.)--Rutgers University, 2009. / "Graduate Program in Mathematics." Includes bibliographical references (p. 114-117).
|
| 256 |
Counting the number of spanning trees in some special graphs /Zhang, Yuanping. January 2002 (has links)
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 70-76). Also available in electronic version. Access restricted to campus users.
|
| 257 |
On the complexity of finding optimal edge rankings /Yue, Fung-ling. January 1996 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 83-84).
|
| 258 |
Efficient algorithms for broadcast routing /Wong, Wai-ha. January 1996 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 74-76).
|
| 259 |
Choice numbers, Ohba numbers and Hall numbers of some complete k-partite graphsAllagan, Julian Apelete D. Johnson, Peter D., January 2009 (has links)
Thesis (Ph. D.)--Auburn University. / Abstract. Vita. Includes bibliographical references (p. 42-43).
|
| 260 |
Sampling edge covers /Rummler, William August. January 2009 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 42-43).
|
Page generated in 0.0411 seconds