Skip to main content
OSTI.GOVU.S. Department of Energy Office of Scientific and Technical Information
U.S. Department of Energy
Office of Scientific and Technical Information
 

Finding strongly connected components in distributed graphs.

Journal Article · · Proposed for publication in the Journal of Parallel and Distributed Computing.
;  [1];
  1. Texas A&M University
+ Show Author Affiliations
No abstract prepared.
Research Organization:
Sandia National Laboratories
Sponsoring Organization:
USDOE
DOE Contract Number:
AC04-94AL85000
OSTI ID:
891278
Report Number(s):
SAND2005-3370J
Journal Information:
Proposed for publication in the Journal of Parallel and Distributed Computing., Journal Name: Proposed for publication in the Journal of Parallel and Distributed Computing.
Country of Publication:
United States
Language:
English

Similar Records

Maintaining connected components for infinite graph streams.
Conference · Fri Feb 01 04:00:00 UTC 2013 · OSTI ID:1063365
Maintaining Connected Components for Infinite Graph Streams.
Conference · Wed Jan 01 04:00:00 UTC 2014 · OSTI ID:1684785
Maintaining Connected Components for Infinite Graph Streams.
Conference · Fri Mar 01 04:00:00 UTC 2019 · OSTI ID:1639494

Related Subjects

Graph theory.
99 GENERAL AND MISCELLANEOUS
CORRELATIONS
DETECTION
DIAGRAMS
INFORMATION RETRIEVAL
Information storage and retrieval systems-Science-Data processing.
Parallel algorithms.