On finding fundamental cut sets

Authors:
Sanjeev Saxena
Affiliations:
Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016
Venue:
Information Processing Letters
Year:
2010

Citing 8
Cited 0

The design and analysis of algorithms

The design and analysis of algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

Journal of Algorithms
Parallel algorithm for finding the most vital edge in weighted graphs

Journal of Parallel and Distributed Computing
Algorithms for three-dimensional dominance searching in linear space

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Fully-Dynamic Min-Cut

Combinatorica
Dominance made simple

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper a linear time algorithm is proposed for preprocessing the edges of a graph. After preprocessing (in linear time), the fundamental cut set of any tree edge can be determined in time proportional to the size of that cut set.