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 2 of 2 for “"Graph immersions"”.
-
MONGE–AMPERE ITERATION
… introduce the affine iteration to be a sequence of graph immersions fi : Rn ,→ Rn+1 such that the affine normal at fi+1(x) is a constant multiple of the position vector fi(x). Thus, the affine iteration is a sequence of prescribed affine normal problems. We prove for any affine iteration {fi}i∈N there …
-
Obstructions and algorithms for graph layouts problems
Modern Graph Theory is heavily influenced by the seminal work of N. Robertson and P. Seymour, known as Graph Minors. Through this work, a wealth of structural, combinatorial, as well as algorithmic, results has been introduced, in a series of papers having as ultimate goal to give an affirmative …