Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Testing Eulerianity and connectivity in directed sparse graphs
Yaron Orenstein, Dana Ron
Research output
:
Contribution to journal
›
Article
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Testing Eulerianity and connectivity in directed sparse graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Automata
14%
Bounded Degree
42%
Bounded Degree Graphs
14%
Decision Problems
14%
Directed Graph
85%
Distance Measure
14%
Distance Parameter
14%
Graph Connectivity
14%
K-edge-connected
42%
Maximum Degree
14%
Number of Vertices
14%
Property Testing
57%
Sparse Graphs
100%
Sublinear Time
14%
System Complexity
14%
Systems Science
14%
Testing Algorithm
100%
Testing Problem
14%
Undirected Graph
42%
Vertex Connectivity
42%
Mathematics
Edge-Connectivity
60%
Maximum Degree
20%
Property Testing
100%
Sparse Graphs
100%
Testing Problem
20%
Computer Science
Automaton
11%
Decision Problem
11%
Directed Graphs
100%
Distance Measure
11%
Testing Problem
11%
Vertex Connectivity
33%