PlumX Metrics
Embed PlumX Metrics

Fast and Accurate Determination of Graph Node Connectivity Leveraging Approximate Methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 12742 LNCS, Page: 500-513
2021
  • 0
    Citations
  • 0
    Usage
  • 0
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Conference Paper Description

For an undirected graph G, the node connectivity K is defined as the minimum number of nodes that must be removed to make the graph disconnected. The determination of K is a computationally demanding task for large graphs since even the most efficient algorithms require many evaluations of an expensive max flow function. Approximation methods for determining K replace the max flow function with a much faster algorithm that gives a lower bound on the number of node independent paths, but this frequently leads to an underestimate of K. We show here that with minor changes, the approximate method can be adapted to retain most of the performance benefits while still guaranteeing an accurate result.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know