Article ID Journal Published Year Pages File Type
10333922 Theoretical Computer Science 2011 19 Pages PDF
Abstract
In this paper, we focus on testing properties of directed graphs (digraphs). In particular, we present the following results (where n is the number of vertices in the graph, d is the maximum degree, and davg is the average degree).
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Testing Eulerianity and connectivity in directed sparse graphs
Authors
, ,