Computing Critical Nodes in Directed Graphs (Q4555541): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129560144, #quickstatements; #temporary_batch_1724739681498 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129560144 / rank | |||
Normal rank | |||
Latest revision as of 07:47, 27 August 2024
scientific article; zbMATH DE number 6981840
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
