Finding an anti-risk path between two nodes in undirected graphs (Q732313): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Finding the most vital arcs in a network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Most vital links and nodes in weighted networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4418662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The k most vital arcs in the shortest path problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the detour-critical edge of a shortest path between two nodes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A faster computation of the most vital edge of a shortest path / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank |
Latest revision as of 01:20, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding an anti-risk path between two nodes in undirected graphs |
scientific article |
Statements
Finding an anti-risk path between two nodes in undirected graphs (English)
0 references
9 October 2009
0 references
shortest path
0 references
shortest path tree
0 references
most vital real time edge
0 references
anti-risk path
0 references