Back to Results
First PageMeta Content
NP-complete problems / Matching / Analysis of algorithms / Graph coloring / Combinatorial optimization / Independent set / Hypergraph / Randomized algorithm / Induced path / Graph theory / Theoretical computer science / Mathematics


November 8, S0129054110007635[removed]:45 WSPC/INSTRUCTION
Add to Reading List

Document Date: 2010-12-13 06:54:39

Open Document

File Size: 349,65 KB

Share Result on Facebook

Company

World Scientific / PerfectMatch / N C. / /

/

Event

Product Issues / Product Recall / /

Facility

Adam Mickiewicz University / /

IndustryTerm

polynomial time search algorithm / main perfect matching algorithm / Parallel algorithms / search version / polynomial time algorithm / search problem / parallel algorithm / above algorithm / /

Organization

MAREK KARPINSKI Department of Computer Science / EDYTA SZYMANSKA Faculty of Mathematics / Hausdorff Center / ANDRZEJ RUCINSKI Faculty of Mathematics and Computer Science / University of Bonn R¨ / Adam Mickiewicz University / /

Person

Oscar H. Ibarra / Chun Yen / MAREK KARPINSKI / /

Position

Prime Minister / /

Product

C. / matching M1 / matching / matchings / /

ProgrammingLanguage

R / /

Technology

using MIS algorithm / parallel algorithms / above algorithm / MIS algorithm / polynomial time algorithm / NC parallel algorithm / parallel algorithm / applying MIS algorithm / 2 parallel algorithm / polynomial time search algorithm / /

SocialTag