Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Testing Properties of Directed Graphs: Acyclicity and Connectivity
Michael A. Bender
*
,
Dana Ron
*
Corresponding author for this work
School of Electrical Engineering
Department of Biomedical Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
38
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Testing Properties of Directed Graphs: Acyclicity and Connectivity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Testing Algorithm
100%
Directed Graph
100%
Adjacency Matrix
100%
Strong Connectivity
100%
Acyclicity
100%
Query Complexity
66%
Time Complexity
66%
Dense Graphs
33%
Distance Parameter
33%
Sparse Graphs
33%
Parameter Independent
33%
Matrix Representation
33%
Graph Representation
33%
Mathematics
Property Testing
100%
Adjacency Matrix
100%
Outgoing Edge
66%
Probability Theory
33%
Query Complexity
33%
Lower and upper bounds
33%
Sparse Graphs
33%
Matrix Representation
33%
Computer Science
Directed Graphs
100%
Adjacency Matrix
100%
Matrix Representation
33%
Time Complexity
33%
Independent Parameter
33%