(Q56271078)

English

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph

No description defined

In more languages

Statements

scholarly article

0 references

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (English)

0 references

author name string

Hillel Gazit

1

0 references

language of work or name

0 references

publication date

December 1991

0 references

SIAM Journal on Computing

0 references

20

0 references

6

0 references

1046-1067

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

Identifiers

10.1137/0220066

0 references

DBLP publication ID

journals/siamcomp/Gazit91

1 reference

DBLP Dataset 2021-01-02

28 January 2021

release_ymeftjph3nfl3n2mko5ngt5mte

1 reference

https://api.fatcat.wiki/v0/release/ymeftjph3nfl3n2mko5ngt5mte

24 November 2022

based on heuristic

mapped directly with Wikidata item

zbMATH Open document ID

0 references

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q56271078&oldid=2058478610"