Testing Eulerianity and connectivity in directed sparse graphs (Q653336)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Testing Eulerianity and connectivity in directed sparse graphs |
scientific article; zbMATH DE number 5995831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing Eulerianity and connectivity in directed sparse graphs |
scientific article; zbMATH DE number 5995831 |
Statements
Testing Eulerianity and connectivity in directed sparse graphs (English)
0 references
9 January 2012
0 references
property testing
0 references
decision problems
0 references
0 references
0.8858455419540405
0 references
0.8786725997924805
0 references
0.8786725997924805
0 references
0.8612166047096252
0 references
0.8584182858467102
0 references
