An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
- 1 September 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (3) , 393-396
- https://doi.org/10.1137/0204034
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Methods for Investigating Connectivity of Large GraphsIEEE Transactions on Circuit Theory, 1969
- Zur allgemeinen KurventheorieFundamenta Mathematicae, 1927