<--- Back to Details
First PageDocument Content
Spanning tree / Minimum spanning tree / Eulerian path / Biconnected component / Euler tour technique / Connected component / Matching / Uzi Vishkin / Graph coloring / Graph theory / Theoretical computer science / Mathematics
Date: 2010-12-09 11:09:54
Spanning tree
Minimum spanning tree
Eulerian path
Biconnected component
Euler tour technique
Connected component
Matching
Uzi Vishkin
Graph coloring
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

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

Download Document from Source Website

File Size: 859,79 KB

Share Document on Facebook

Similar Documents

Crowdrise / Gamification / Arbitration / Arbitral tribunal / American Arbitration Association / Law / GoFundMe / Economy

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

Economy / Business / Small Business Administration / Small Business Innovation Research / Kickstart / Wyoming Business Council / Funding / Entrepreneurship

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

DocID: 1xVRT - View Document

Mathematics / Computational complexity theory / Lloyd Shapley / Matching / Combinatorics / Game theory / Cooperative games / Stable marriage problem / CC / Shapley / Marriage problem

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

Computer programming / Software engineering / Declarative programming / Recursion / Functional programming / Computability theory / Theoretical computer science / Programming paradigms / Algebraic data type / Fold / Pattern matching / Conditional

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

Computer programming / Software engineering / Combinatorial optimization / Matching / Monad / Conditional

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

DocID: 1xV4c - View Document