A linear algorithm for bipartition of biconnected graphs
Authors:
- Hitoshi SuzukiHSHitoshi Suzuki
- Naomi TakahashiNTNaomi Takahashi
- Takao NishizekiTNTakao Nishizeki
- 1 January 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (5) , 227-231
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- On the complexity of partitioning graphs into connected subgraphsDiscrete Applied Mathematics, 1985
- A homology theory for spanning tress of a graphActa Mathematica Hungarica, 1977