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
Bottleneck paths and trees and deterministic graphical games
Shiri Chechik, Haim Kaplan,
Mikkel Thorup
, Or Zamir, Uri Zwick
Department of Computer Science
1
Citation (Scopus)
34
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bottleneck paths and trees and deterministic graphical games'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bottleneck Paths
100%
Graphical Games
100%
Turn-based
50%
Directed Spanning Tree
50%
Bottleneck Steiner Tree
50%
Time Comparison
50%
Algorithm Comparison
50%
Spanning Tree Problem
50%
Weighted Directed Graph
50%
Terminal Payoff
50%
Path Problems
50%
Mathematics
Edge
100%
Running Time
66%
Spanning Tree
66%
Tree Problem
33%
Model Comparison
33%
Open Problem
33%
Path Problem
33%
Computer Science
Spanning Tree
100%
Randomized Algorithm
50%
Directed Graph
50%