Computing Critical Nodes in Directed Graphs (Q4555541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6981840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Critical Nodes in Directed Graphs |
scientific article; zbMATH DE number 6981840 |
Statements
Computing Critical Nodes in Directed Graphs (English)
0 references
20 November 2018
0 references
combinatorial optimization
0 references
NP-hardness
0 references
critical nodes
0 references
directed graphs
0 references
strong articulation points
0 references
strong connectivity
0 references
0.9999999
0 references
0.90144813
0 references
0.9008127
0 references
0.8951156
0 references
0.88599324
0 references
0.87924206
0 references
0 references
