Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (Q754894): Difference between revisions

@@ Property / author @@
-Sunil R. Das
@@ Property / author: Sunil R. Das / rank @@
-Normal rank
@@ Property / author @@
+Sunil R. Das
@@ Property / author: Sunil R. Das / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0255(78)90041-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1972985839
@@ Property / OpenAlex ID: W1972985839 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential Algorithm for the Determination of Maximum Compatibles
+Normal rank
@@ Property / cites work @@
+On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
+Normal rank
@@ Property / cites work @@
+Analysis of Graphs by Connectivity Considerations
@@ Property / cites work: Analysis of Graphs by Connectivity Considerations / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean Algebra, Map Coloring, and Interconnections
+Normal rank
@@ Property / cites work @@
+Q3285875
@@ Property / cites work: Q3285875 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank