Dijkstra

Results: 449



#Item
71Network theory / NP-complete problems / Edsger W. Dijkstra / Graph coloring / Spanning tree / Matching / Shortest path problem / Logical matrix / Treewidth / Matrix / Minimum spanning tree / Clique

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11
72NP-complete problems / Combinatorial optimization / Routing algorithms / Search algorithms / Edsger W. Dijkstra / Dominating set / A* search algorithm / Optimization problem / Minimum spanning tree / Shortest path problem / Treewidth / Flow network

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ad-publications.informatik.uni-freiburg.de

Language: English - Date: 2013-04-29 10:40:39
73NP-complete problems / Edsger W. Dijkstra / Spanning tree / Matroid theory / Operations research / Online algorithm / Steiner tree problem / Matroid / Shortest path problem / Algorithm / Travelling salesman problem / Greedy algorithm

CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-04 19:18:44
74Computer engineering / Computer science / Electrical engineering / Electronic engineering / Science education / National Curriculum / Curriculum / Educational technology / Computing / Women in computing / Edsger W. Dijkstra

Computing at school in the UK Simon Peyton Jones, Microsoft Research Bill Mitchell, BCS Academy of Computing Simon Humphreys, Computing At School April 2013 v5 Under review by CACM

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-04-08 03:24:04
75Papyrology / American Society of Papyrologists / Abbreviation / Papyrus / Citation

THE BULLETIN OF THE AMERICAN SOCIETY OF PAPYROLOGISTS PETER VAN MINNEN, TIMOTHY RENNER, JITSE DIJKSTRA Editorial Board Stylesheet for Contributors Contents

Add to Reading List

Source URL: www.papyrology.org

Language: English - Date: 2015-06-18 10:54:12
76Network theory / Networks / Graph theory / Edsger W. Dijkstra / Shortest path problem / Small-world network / Peter Killworth / Markov chain / Conceptual model / Path

Social Networks–96 The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Add to Reading List

Source URL: nersp.nerdc.ufl.edu

Language: English - Date: 2007-02-01 12:43:34
77Routing protocols / Internet Standards / Internet protocols / Routing / Edsger W. Dijkstra / Border Gateway Protocol / Routing algorithms / Open Shortest Path First / Strategyproofness / Shortest path problem / Routing loop problem / Multipath routing

Distributed Computing manuscript No. (will be inserted by the editor) A BGP-based Mechanism for Lowest-Cost Routing Joan Feigenbaum1 , Christos Papadimitriou2 , Rahul Sami†3 , Scott Shenker ‡4 1

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-02-14 08:26:45
78Concurrency control / Edsger W. Dijkstra / Monitor / Hoare logic / Event / Semaphore / Concurrent computing / Pascal / XC / Flag semaphore / ALGOL 68 / Unix signal

A Note on Monitor Versions Essay in the Honour of C.A.R. Hoare Ole-Johan Dahl Department of Informatics University of Oslo, Norway 30th July 1999

Add to Reading List

Source URL: www.olejohandahl.info

Language: English - Date: 2013-09-23 13:44:35
79Network theory / Graph theory / Graph connectivity / Networks / Edsger W. Dijkstra / Centrality / Betweenness centrality / Shortest path problem / Randomized algorithm / Connected component / Line graph

XX ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages MATTEO RIONDATO, Two Sigma Investments, LP ELI UPFAL, Brown University

Add to Reading List

Source URL: matteo.rionda.to

Language: English - Date: 2016-07-30 12:22:15
80Operations research / Edsger W. Dijkstra / Network theory / Shortest path problem / Mathematical optimization / Routing algorithms / Systems engineering / Dynamic programming

Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK

Add to Reading List

Source URL: www.monmeetings.org

Language: English - Date: 2015-09-04 10:24:56
UPDATE