<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / Edsger W. Dijkstra / Combinatorial optimization / Network theory / Maximal independent set / Graph coloring / Shortest path problem / Matching / Leader election / Minimum spanning tree
Date: 2014-07-11 14:03:09
Graph theory
Mathematics
Computational complexity theory
Edsger W. Dijkstra
Combinatorial optimization
Network theory
Maximal independent set
Graph coloring
Shortest path problem
Matching
Leader election
Minimum spanning tree

Add to Reading List

Source URL: security.cs.georgetown.edu

Download Document from Source Website

File Size: 362,19 KB

Share Document on Facebook

Similar Documents

THE DUCKDUCKGO $500,000 PRIVACY CHALLENGE $3,000 DOLLAR FOR DOLLAR DONATION MATCHING INCENTIVE OFFICIAL RULES The DuckDuckGo $500,000 Privacy Challenge (the “Challenge”) $3,000 Dollar-for-Dollar Donation Matching Inc

THE DUCKDUCKGO $500,000 PRIVACY CHALLENGE $3,000 DOLLAR FOR DOLLAR DONATION MATCHING INCENTIVE OFFICIAL RULES The DuckDuckGo $500,000 Privacy Challenge (the “Challenge”) $3,000 Dollar-for-Dollar Donation Matching Inc

DocID: 1xW1O - View Document

Rules and Procedures Overview Kickstart:Wyoming Program SBIR Phase I and II Matching Program  1

Rules and Procedures Overview Kickstart:Wyoming Program SBIR Phase I and II Matching Program 1

DocID: 1xVRT - View Document

Computational Social Choice  UPS Toulouse, 2015 Matching In a variant of the fair allocation problem, we try to match each agent

Computational Social Choice UPS Toulouse, 2015 Matching In a variant of the fair allocation problem, we try to match each agent

DocID: 1xVtU - View Document

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin  University of York, UK

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK

DocID: 1xVgx - View Document

Efficient E-matching for SMT Solvers Leonardo de Moura, Nikolaj Bjørner Microsoft Research, Redmond

Efficient E-matching for SMT Solvers Leonardo de Moura, Nikolaj Bjørner Microsoft Research, Redmond

DocID: 1xV4c - View Document