On Finding Minimal 2-Connected Subgraphs (original) (raw)
Related papers
On Finding Minimal Two-Connected Subgraphs
1992
Computing Minimal Spanning Subgraphs In Linear Time
Proceedings of the third …, 1992
A parallel algorithm for computing minimum spanning trees
Proceedings of the fourth annual ACM …, 1992
The Complexity of Finding Minimal Spanning Subgraphs
1991
An Experimental Study of Polynomial Time Algorithms for Minimum 2-Edge Connected Subgraph Problem
International Journal of Computer Science and Mobile Computing (IJCSMC), 2024
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
SIAM Journal on Computing, 1984
Generating 3-vertex connected spanning subgraphs
Discrete Mathematics, 2008
Generating Minimal k-Vertex Connected Spanning Subgraphs
Lecture Notes in Computer Science, 2007
A Parallel Algorithm for Constructing Minimum Spanning Trees
Efficient parallel algorithms for graph problems
Algorithmica, 1990
ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS
International Journal of Foundations of Computer Science, 2014
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
Yefim Dinitz, Domenico Parente, Vincenzo Auletta
Journal of Algorithms, 1999
Parallel algorithms for graph problems
Dartmouth College, Hanover, NH, 1992
An optimal pram algorithm for a spanning tree on trapezoid graphs
Journal of Applied Mathematics and Computing, 2003
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Algorithmica, 1996
A coarse-grained parallel algorithm for spanning tree and connected components
2004
Optimal algorithms for the vertex updating problem of a minimum spanning tree
Parallel Processing Symposium, 1992
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
ACM Transactions on Algorithms, 2019
A simple and practical linear-work parallel algorithm for connectivity
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Generating k-vertex connected spanning subgraphs and k-edge connected spanning subgraphs
Graph algorithms on a tree-structured parallel computer
BIT, 1984
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
Journal of Algorithms, 1999
A New Parallel Algorithm for Minimum Spanning Tree(MST
IJASCSE International Journal of Computer Science & Engineering
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Theoretical Computer Science, 1994
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
Algorithmica, 2002
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs
Linear time algorithms for graph search and connectivity determination on complement graphs
Information Processing Letters, 1998
Better algorithms for minimum weight vertex-connectivity problems
Lecture Notes in Computer Science, 1997