Back to Results
First PageMeta 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


Document Date: 2010-12-09 11:09:54

Open Document

File Size: 859,79 KB

Share Result on Facebook

City

Edmonton / New York / Ithaca / New York York / Amsterdam / Reading / Ames / /

Company

IBM / AT&T Bell Laboratories / SIAM J. Comp / Bell Laboratories / Vertex / /

Country

Canada / Israel / /

Currency

USD / /

Event

Product Issues / /

Facility

Tel Aviv University / Courant Institute / Computer University / New York University / Cornell University / Iowa State University / University of Alberta / /

IndustryTerm

linear graph algorithms / hiconnectivity algorithm / block-finding algorithm / serial algorithm / parallel algorithms / serial algorithms / minimum spanning forest algorithm / parallel hiconnectivity algorithms / connected components algorithms / time-processor product / parallel connectivity algorithm / parallel biconnectivity algorithm / linear-time algorithm / processor sorting algorithm / connectivity algorithm / graph algorithms / search algorithm / parallel computation algorithms / similar algorithm / linear-time search / latter algorithm / serial time using depth-first search / parallel connectivity algorithms / graph algorithm / bridge-finding algorithm / randomized sorting algorithm / connected components algorithm / Depth-first search / linear-time search method / fewer processors / sequential algorithm / linear size networks / computing / parallel algorithm / /

Organization

New York University / National Science Foundation / Courant Institute / Iowa State University / University of Alberta / Tel Aviv University / Tel Aviv / Computer Science Department / Cornell University / Department of Computer Science / Technical Report Science Department / Computer University / /

Person

Uzi Vishkin / Thomas J. Watson / Addison Wesley / Robert E. Tarjan / Murray Yill / Murray Hill / /

/

Position

second author / /

Product

Uzi / Euler / list / /

ProvinceOrState

Alberta / New Jersey / New York / Iowa / Massachusetts / /

PublishedMedium

Theory of Computing / /

Technology

This algorithm / m-1 processors / RAM / two known connected components algorithms / latter algorithm / parallel computation algorithms / AV / %he algorithm / linear graph algorithms / search algorithm / bridge-finding algorithm / time algorithm / parallel hiconnectivity algorithms / parallel connectivity algorithm / components algorithm / The algorithm / block-finding algorithm / randomized sorting algorithm / processor sorting algorithm / Parallel graph algorithm / parallel biconnectivity algorithm / graph algorithms / parallel connectivity algorithms / one processor / minimum spanning forest algorithm / connectivity algorithm / resulting algorithm / sorting algorithm / 811 connectivity algorithm / similar algorithm / hiconnectivity algorithm / Shiloach-Vishkin algorithm / time algorithms / connected components algorithm / simulation / linear-time algorithm / Parallel Processing / /

SocialTag