TL;DR
This paper introduces an algorithm that determines graph connectivity and identifies all connected components from an adjacency matrix, with a mathematical proof of correctness.
Contribution
It provides a novel algorithm for connectivity analysis with a formal proof of its accuracy.
Findings
Algorithm correctly identifies all connected components.
Mathematically proven to produce accurate results.
Efficient for adjacency matrix representations.
Abstract
In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is mathematically proved that the algorithm presents all the desired results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Interconnection Networks and Systems