Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

Weighted SCAN for Modeling Cooperative Group Role Dynamics Anton Chertov, Ziad Kobti, and Scott D. Goodwin world scenarios. However, SCAN in its current form targets only unweighted graphs and we identify a serious limit

Source URL: game.itu.dk

• Graph theory
• Mathematics
• Network theory
• Algebraic graph theory
• Edsger W. Dijkstra
• Cluster analysis
• Data mining
• Graph
• Spectral clustering
• Modularity
• Pathfinding
• Split

RFID-Based Hybrid Metric-Topological SLAM for GPS-denied Environments Christian Forster1 , Deon Sabatta2,3 , Roland Siegwart2 , Davide Scaramuzza1 Abstract— In this work, we propose a novel RFID-based hybrid metric-top

Source URL: rpg.ifi.uzh.ch

• Indoor positioning system
• Automatic identification and data capture
• Ubiquitous computing
• Robot navigation
• Edsger W. Dijkstra
• Robotic mapping
• Radio-frequency identification
• Simultaneous localization and mapping
• Shortest path problem
• Occupancy grid mapping

Interference Arises at the Receiver Martin Fussen, Roger Wattenhofer, Aaron Zollinger {mafussen@student, , }.ethz.ch Computer Engineering and Networks Laboratory ETH Zurich, Switzerland

Source URL: disco.ethz.ch

• Graph theory
• Computing
• Mathematics
• Wireless networking
• Network theory
• Wireless sensor network
• Routing algorithms
• Edsger W. Dijkstra
• Topology control
• Flow network
• Wireless ad hoc network
• Tree

Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Edsger W. Dijkstra
• Spanning tree
• Combinatorial optimization
• Network theory
• Shortest path problem
• Connectivity
• Distributed computing
• Minimum spanning tree
• Clique
• Matching

M. Dijkstra (UiO) Aspen, 2016 Mark Dijkstra

Source URL: firstgalaxies.org

MACHINE-ASSISTED CONCURRENT PROGRAMMING Martin Vechev ETH Zürich (joint work with Eran Yahav, Greta Yorsh, Michael Kuperstein, Nayden Nedev, Nedyalko Prisadnikov, Veselyn Raychev)

Source URL: www.srl.inf.ethz.ch

• Edsger W. Dijkstra
• Curr
• Algorithm
• Goto
• Programming Language Design and Implementation

JMLR: Workshop and Conference Proceedings vol 40:1–20, 2015 S2 : An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification Gautam Dasarathy

Source URL: jmlr.org

• Graph connectivity
• Graph theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Bridge
• Connected component
• Connectivity
• Graph
• Routing algorithms
• Planar separator theorem
• Minimum spanning tree

CSc 220: Algorithms Sample Final Problem 1: For each statement below, say if it is True or False. • Dijkstra’s algorithm works on graphs with arbitrary weight functions. False • The Prim algorithm to compute the MS

Source URL: www-cs.ccny.cuny.edu

November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology

Source URL: courses.csail.mit.edu

• Network theory
• Edsger W. Dijkstra
• Graph connectivity
• Routing algorithms
• Spanning tree
• Graph
• Shortest path problem
• Strongly connected component
• Cycle
• Longest path problem
• Connected component
• FloydWarshall algorithm