Spelling suggestions: "subject:"paths anda cycles (graph theory)"" "subject:"paths anda cycles (raph theory)""
1 |
Variation of cycles in projective spaces.January 2007 (has links)
Lau, Siu Cheong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 51-52). / Abstracts in English and Chinese. / Chapter 1 --- In search of minimal cycles --- p.9 / Chapter 1.1 --- What do we mean by cycles? --- p.9 / Chapter 1.2 --- Integral currents --- p.10 / Chapter 1.3 --- Calibration theory --- p.13 / Chapter 2 --- Motivation from the Hodge Conjecture --- p.17 / Chapter 2.1 --- Hodge theory on Riemannian manifolds --- p.17 / Chapter 2.2 --- Hodge decomposition in Kahler manifolds --- p.19 / Chapter 2.3 --- The Hodge conjecture --- p.22 / Chapter 3 --- Variation of cycles in symmetric orbit --- p.26 / Chapter 3.1 --- Variational formulae --- p.26 / Chapter 3.2 --- Stability of cycles in Sm and CPn --- p.29 / Chapter 3.3 --- Symmetric orbit in Euclidean space --- p.31 / Chapter 3.4 --- Projective spaces in simple Jordan algebra --- p.39 / Chapter 3.4.1 --- Introduction to simple Jordan algebra --- p.39 / Chapter 3.4.2 --- Projective spaces as symmetric orbits --- p.41 / Chapter 3.4.3 --- Computation of second fundamental form --- p.43 / Chapter 3.4.4 --- The main theorem --- p.45 / Chapter 3.5 --- Future directions --- p.49 / Bibliography --- p.51
|
2 |
Efficient algorithms for disjoint paths problems in grids陳宏達, Chan, Wun-tat. January 1999 (has links)
published_or_final_version / abstract / toc / Computer Science and Information Systems / Doctoral / Doctor of Philosophy
|
3 |
Efficient algorithms for disjoint paths problems in grids /Chan, Wun-tat. January 1999 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 93-98).
|
4 |
Cycles and coloring in graphsSong, Zengmin 01 January 2001 (has links)
No description available.
|
5 |
Caterpillar tolerance representations of graphs /Faubert, Glenn E. January 2005 (has links)
Thesis (Ph. D.)--University of Rhode Island, 2005. / Typescript. Includes bibliographical references (leaf 36).
|
6 |
On the shortest path and minimum spanning tree problemsPettie, Seth 28 August 2008 (has links)
Not available / text
|
7 |
Improved shortest path algorithms by dynamic graph decomposition : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science and Software Engineering in the University of Canterbury /Tian, Lin. January 2006 (has links)
Thesis (M. Sc.)--University of Canterbury, 2006. / Typescript (photocopy). Includes bibliographical references (p. 77-79). Also available via the World Wide Web.
|
8 |
Path and cycle decompositionsDinavahi, Chandra, Rodger, C. A. January 2008 (has links) (PDF)
Thesis (Ph. D.)--Auburn University, 2008. / Abstract. Vita. Includes bibliographical references (p. 50-51).
|
9 |
On the shortest path and minimum spanning tree problemsPettie, Seth, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
|
10 |
Using the structure of d-connecting paths as a qualitative measure of the strength of dependence /Chaudhuri, Sanjay, January 2005 (has links)
Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (p. 94-95).
|
Page generated in 0.1109 seconds