Steiner System is a combinatorial design in incidence geometry consisting of a finite set of points and a collection of subsets called blocks, such that every t-element subset of points is contained in exactly one block, where t is a fixed integer greater than 1.
718
Publications
28.2K
Citations
1K
Authors
500
Institutions
Publications per year
2017–2026
41
Parents
Publications
718
A fast algorithm for Steiner trees
Lawrence T. Kou, George Markowsky, L. Berman · Acta Informatica · 1981 · 1.2K citations
An approximate solution for the Steiner problem in graphs
Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 1980 · 884 citations
Planar Formulae and Their Uses
David Lichtenstein · SIAM Journal on Computing · 1982 · 754 citations
1–5 of 718
Authors
1K
- FK
13
h-index
- DD
13
h-index
- MZ
12
h-index
- AR
12
h-index
- CJ
12
h-index
1–5 of 1K
Institutions
500
Auburn University
Auburn, United States
15 h-index
22 publications
877 citations
McMaster University
Hamilton, Canada
15 h-index
25 publications
793 citations
AT&T (United States)
Bedminster, United States
14 h-index
20 publications
1.1K citations
University of Waterloo
Waterloo, Canada
13 h-index
27 publications
643 citations
University of Copenhagen
Copenhagen, Denmark
13 h-index
24 publications
760 citations
The University of Melbourne
Melbourne, Australia
13 h-index
42 publications
972 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
12 h-index
33 publications
701 citations
University of Toronto
Toronto, Canada
11 h-index
17 publications
349 citations
1–8 of 500
Venues
- Journal of Combinatorial Theory Series A
44 publications · 1.6K citations
24
h-index
- Discrete Mathematics
50 publications · 1.5K citations
23
h-index
- Journal of Combinatorial Designs
JCD · 38 publications · 840 citations
19
h-index
- Discrete Applied Mathematics
20 publications · 606 citations
16
h-index
- Algorithmica
23 publications · 1.1K citations
15
h-index
1–5