NDLTD logo NDLTD Union Catalog and Global ETD Search

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 20 of 173 for “"Steiner"”.

  1. Generalized Group Steiner Trees

    Baizhan, DarkhanUniversity of Illinois Urbana-Champaign2025

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-05-01

    uiuc Repository record

  2. Steiner triple systems and cycle structure

    Murphy, John PatrickUniversity of Central Lancashire1999

    … published his first paper [24], research in Steiner triple systems has grown steadily. With increased and ready access to more powerfiul computers in recent times, this growth has accelerated significantly. Problems are now being solved which were previously considered too 'big' to …

    cent-lancashire Repository record

  3. The Prize Collecting Steiner Tree problem

    Minkoff, Maria, 1976-Massachusetts Institute of Technology2000

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.

    mit Repository record

  4. Anti-pasch and pasch steiner triple systems

    Phelan, John StephenLancashire Polytechnic1991

    … on the study of anti-Pasch and Pasch Steiner triple systems and existence results / concerning these. After the introductory Chapter, Chapters 2, 3, 4, 5 treat anti-Pasch systems and the last the reverse problem of Pasch systems. Chapter 1 introduces the basic concepts and definitions …

    cent-lancashire Repository record

  5. Algorithms for Generalized Steiner Network (Gsn) Problems

    Smith, James MacgregorUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-13T19:55:31Z (GMT). No. of bitstreams: 1 7913615.pdf: 8949373 bytes, checksum: f180f7375a7e1c455d10e82792fad903 (MD5) Previous issue date: 1978

    uiuc Repository record

  6. Tricyclic Steiner Triple Systems with 1-Rotational Subsystems.

    Tran, Quan Duc2007

    <p>A Steiner triple system of order <em>v</em>, denoted <em>STS</em>(<em>v</em>), is said to be <em>tricyclic</em> if it admits an automorphism whose disjoint cyclic decomposition consists of three cycles. In this thesis we give necessary and sufficient conditions for the existence of a tricyclic …

    etsu Repository record

  7. Quasi-Groups and Loops Associated with Steiner Systems

    Hale, W. D.University of Cambridge1952

    cambridge

  8. Computing techniques for the enumeration of cyclic Steiner systems

    Frenz, Timothy, Carl

    rit Repository record

  9. A Variety of Proofs of the Steiner-Lehmus Theorem

    Gardner, Sherri R2013

    <p>The Steiner-Lehmus Theorem has garnered much attention since its conception in the 1840s. A variety of proofs resulting from the posing of the theorem are still appearing today, well over 100 years later. There are some amazing similarities among these proofs, as different as they seem to be. …

    etsu Repository record

  10. An ethnographic study of ‘Steiner Fever’ in China: Why are Chinese parents turning away from mainstream education towards the holistic ‘way’ of Steiner education?

    Sun, YifanUniversity of Cambridge2020

    … of Cambridge Title: An ethnographic study of ‘Steiner Fever’ in China: Why are Chinese parents turning away from mainstream education towards the holistic ‘way’ of Steiner education? In recent years, China has seen a major expansion of alternative education, an aspect of which is the ‘Steiner …

    cambridge Repository record

  11. Computer construction of (4,4,v)-threshold schemes from Steiner Quadruple Systems

    Monroe, W., John

    rit Repository record

  12. The Steiner Linear Ordering Problem: Application to resource-constrained scheduling problems

    Magagnotti, Mariah

    clemson Repository record

  13. PARTITIONING THE BLOCKS OF A STEINER TRIPLE SYSTEM INTO PARTIAL PARALLEL CLASSES

    Hodaj, Jezerca

    mtu Repository record

  14. The Directed Steiner Network problem is tractable for a constant number of terminals

    Feldman, Jon, 1975-Massachusetts Institute of Technology2000

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.

    mit Repository record

  15. Learning to become a subject: A hermeneutic phenomenological study of students in a Waldorf (Steiner) school in Germany

    Rawson, Martyn2018

    … phenomenological study of students in a Waldorf (Steiner) school in Germany The centrals aim of Steiner pedagogy include enabling young people to develop as persons, to become socially responsible subjects capable of contributing constructively to society Steiner (1985) and the curriculum used in …

    plymouth Repository record

  16. Decomposing the blocks of a Steiner triple system of order 4v-3 into partial parallel classes of size v-1

    Tollefson, Leah C

    mtu Repository record

  17. Combinatorial designs and their automorphism groups

    Lovegrove, Graham JohnThe Open University2009

    This thesis concerns the automorphism groups of Steiner triple systems and of cycle systems. Although most Steiner triple systems have trivial automorphism groups [2], it is widely known that for every abstract group, there exists a Steiner triple system whose automorphism is isomorphic to that …

    the-open-u Repository record

  18. Two new algorithms for classical problems in computer science

    Howe, John Gerard

    … simple bookkeeping approximation solution to the Steiner tree problem in graphs. The problem presented deals with determining the shortest tree connecting Steiner nodes in a graph that has no direct connections between the Steiner nodes. Both algorithms are described and analyzed in detail with an …

    unlv Repository record

  19. ON RELAY NODE PLACEMENT PROBLEM FOR SURVIVABLE WIRELESS SENSOR NETWORKS

    Jung, Changyong2018

    … many algorithms have been developed based on Steiner graphs. Since RNP for a connected graph is NP-hard, the RNP for a survivable network has been conjectured as NP-hard and the algorithms for a survivable network have also been developed based on Steiner graphs. In this study, we show the new …

    vcu Repository record

  20. El uso del evea y su relación con el profesorado de la unidad educativa steiner internacional de la sección primaria, de la ciudad de Guayaquil: un estudio de caso

    Peláez López, Rosario2019

    … en la Sección Primaria de la Unidad Educativa Steiner Internacional, centro educativo ubicado en la ciudad de Guayaquil, Ecuador. Partiendo de esta experiencia laboral; así como, de la participación activa en el mejoramiento de la calidad educativa del centro, se pone en valor la relevancia de …

    cadiz Repository record

Page 1 of 9