Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880)
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 the (s,t) connectivity of graphs and digraphs |
scientific article; zbMATH DE number 6049397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing the \((s,t)\) connectivity of graphs and digraphs |
scientific article; zbMATH DE number 6049397 |
Statements
Testing the \((s,t)\) connectivity of graphs and digraphs (English)
0 references
25 June 2012
0 references
property testing
0 references
disconnectivity
0 references
Horn SAT
0 references
general graph model
0 references
bounded-degree model
0 references
0.9387361
0 references
0.9230737
0 references
0.90710425
0 references
0.90710425
0 references
0.89379644
0 references
0.89023143
0 references
0.8880147
0 references
0.88694096
0 references
