Dorothea Wagner Algorithm Engineering e s i g Route Planning D - - PowerPoint PPT Presentation

dorothea wagner
SMART_READER_LITE
LIVE PREVIEW

Dorothea Wagner Algorithm Engineering e s i g Route Planning D - - PowerPoint PPT Presentation

Dorothea Wagner Algorithm Engineering e s i g Route Planning D n E Graph Clustering x p e e z r Graph Drawing i y Algorithmics m l a e n n Social Network Analysis A t Sensor Networks t n e I m m p e l Energy


slide-1
SLIDE 1

Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Dorothea Wagner

D e s i g n E x p e r i m e n t I m p l e m e t n A n a l y z e Algorithmics

1

Algorithm Engineering Route Planning Graph Clustering Graph Drawing Social Network Analysis Sensor Networks Energy Networks

. . .

slide-2
SLIDE 2

Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Route Planning

fast shortest path computations (on-board and off-board) practical applications (Google, Microsoft, Nokia, telenav, ...) time dependence and dynamic traffic data flexible objectives (e.g. , travel time vs. cost) and constraints (e.g. , vehicle size, weight, toll roads) public transport multimodal route planning alternative routes intelligent point-of-interest search theory

slide-3
SLIDE 3

Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Graph Clustering

network analysis and exploration (social, biological, technical, ...) compute densely connected subgraphs (clusters) evaluate structure and function of clusters = dynamic networks temporal tracing of clusters

new cluster G0 G1 G2

slide-4
SLIDE 4

Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Graph Drawing

algorithms for visualizing graphs in the plane applications: sociology, biology, UML-diagrams, ... examples of our research: constrained planar graph drawings (e.g., point set embedding, extending partial drawings) alternative drawing conventions argument maps

? +