%0 Journal Article %1 journals/jcst/MaM94 %A Ma, Jun %A Ma, Shaohan %D 1994 %J J. Comput. Sci. Technol. %K dblp %N 1 %P 86-91 %T An O(k 2n2) algorithm to find a k -partition in a k -connected graph. %U http://dblp.uni-trier.de/db/journals/jcst/jcst9.html#MaM94 %V 9

@article{journals/jcst/MaM94, added-at = {2022-10-21T00:00:00.000+0200}, author = {Ma, Jun and Ma, Shaohan}, biburl = {https://www.bibsonomy.org/bibtex/266ef9b63b1a3dfc405099713952e3f5d/dblp}, ee = {https://doi.org/10.1007/BF02939489}, interhash = {6f831fbab3657104388d830d845884b2}, intrahash = {66ef9b63b1a3dfc405099713952e3f5d}, journal = {J. Comput. Sci. Technol.}, keywords = {dblp}, number = 1, pages = {86-91}, timestamp = {2024-04-08T14:31:28.000+0200}, title = {An O(k 2n2) algorithm to find a k -partition in a k -connected graph.}, url = {http://dblp.uni-trier.de/db/journals/jcst/jcst9.html#MaM94}, volume = 9, year = 1994 }