Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Bounding the expected number of rectilinear full Steiner trees
Christian Wulff-Nilsen
Department of Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bounding the expected number of rectilinear full Steiner trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Rectilinear
100%
Tree Problem
50%
Hypercube
50%
Unique Decomposition
50%
Necessary Condition
50%
Spanning Tree
50%
Keyphrases
Lune
40%
Unique Decomposition
20%
Disjoint
20%
Bottleneck Property
20%
Hyperbox
20%
Hypercube
20%