Skip to main navigation
Skip to search
Skip to main content
Lund University Home
English
Svenska
Home
Profiles
Research output
Projects
Units
Infrastructure
Activities
Prizes and Distinction
Search by expertise, name or affiliation
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Martin Wahlén
Research output
:
Thesis
›
Doctoral Thesis (compilation)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithmic Graph Problems - From Computer Networks to Graph Embeddings'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Graph Embedding
100%
Computer Networks
96%
Exponential time
78%
Graph in graph theory
33%
Broadcasting
7%
Tutte Polynomial
6%
Radio Networks
5%
Vertex of a graph
5%
Computational Complexity
5%
Computing
4%
Minor
3%
Multi-hop
3%
Power Consumption
2%
Failure Probability
2%
Energy
2%
Broadcast
2%
Maximum Independent Set
2%
Counting Problems
2%
Approximability
2%
Interference
2%
Multigraph
2%
Euclidean Distance
2%
Subset
2%
Combinatorial Problems
1%
Minimum Distance
1%
Overlap
1%
Homeomorphic
1%
Clique
1%
Homeomorphism
1%
Complete Graph
1%
Counting
1%
Upper and Lower Bounds
1%
Adjacent
1%
Subgraph
1%
Minimise
1%
Knowledge
1%
Lower bound
1%
Model
1%
Denote
1%
Polynomial
0%