Testing properties of directed graphs: acyclicity and connectivity* (Q4543627): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Probabilistic checking of proofs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4941829 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Interactive proofs and the hardness of approximating cliques / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Property testing and its connection to learning and approximation / rank | |||
Normal rank | |||
Latest revision as of 11:28, 4 June 2024
scientific article; zbMATH DE number 1777570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing properties of directed graphs: acyclicity and connectivity* |
scientific article; zbMATH DE number 1777570 |
Statements
Testing properties of directed graphs: acyclicity and connectivity* (English)
0 references
8 August 2002
0 references
sparse graphs
0 references
strong connectivity
0 references
