On the Strongly Connected and Biconnected Components of the Complement of Graphs

DOI10.1016/j.endm.2004.03.044zbMath1125.05320OpenAlexW2077834085MaRDI QIDQ3439158

Leonidas Palios, Stavros D. Nikolopoulos

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.044

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel algorithms for the connected components and minimal spanning tree problems
• Improving the efficiency of parallel minimum spanning tree algorithms
• An optimal parallel co-connectivity algorithm
• Linear time algorithms for graph search and connectivity determination on complement graphs.
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
• Computing connected components on parallel computers
• Efficient parallel algorithms for some graph problems
• An O(logn) parallel connectivity algorithm
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation

This page was built for publication: On the Strongly Connected and Biconnected Components of the Complement of Graphs