1997
DOI: 10.1006/jpdc.1997.1383
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2003
2003
2010
2010

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Let us number the vertices of the tree in preorder [1] and let pre(v) denote the preorder number of v and desc(v) the number of descendants of vertex v with respect to the spanning tree T of G. We will use α(v) to denote the quantity pre(v) + desc(v) [3].…”
Section: Algorithmmentioning
confidence: 99%
“…Let us number the vertices of the tree in preorder [1] and let pre(v) denote the preorder number of v and desc(v) the number of descendants of vertex v with respect to the spanning tree T of G. We will use α(v) to denote the quantity pre(v) + desc(v) [3].…”
Section: Algorithmmentioning
confidence: 99%
“…Algorithms for the most vital edge problems on shortest paths include Bar-Noy et al (1995), Malik et al (1989), Venema et al (1996). Algorithms for finding the most vital edges in minimum cost spanning trees have been developed by Hsu et al (1991), Hsu et al (1992), Iwano and Kato (1993), and Banerjee and Saxena (1997). The most vital edge problem for minimum cost spanning trees is not directly related to the problem of identifying edge tolerances, although both are fundamental questions of sensitivity analysis.…”
mentioning
confidence: 99%