Free Access
RAIRO-Oper. Res.
Volume 11, Number 2, 1977
Page(s) 175 - 199
Published online 06 February 2017
  • 1. C. BERGE, Théorie des graphes et ses applications, Dunod, 1956. [MR: 102822] [Zbl: 0121.40101] [Google Scholar]
  • 2. C. BERGE, Graphes et Hypergraphes, Dunod, 1970. [MR: 357173] [Zbl: 0213.25702] [Google Scholar]
  • 3. W. E. DONATH - A. J. HOFFMAN, Algorithms for partitioning of graphs and computer logic based on eigen vectors of connection matrices, IBM Technical Report. [Google Scholar]
  • 4. G. I. ORLOVA, Optimum partition of a graph into several subgraphs Engineering Cybernetic, Vol. 10, 103, 1972. [MR: 325454] [Google Scholar]
  • 5. F. Luccio - M. SAMI, On the decomposition of networks into minimally interconnected subnetworks, IEE transactions on Circuit Theory, CT-16, Vol. 2, 1972. [MR: 242579] [Google Scholar]
  • 6. B. W. KERNIGHAN, An effective heuristic procedure for partioning graphs, BSTJ, Vol 49. 291, 1970. [Zbl: 0333.05001] [Google Scholar]
  • 7. M. RICHETIN, Algorithme de décomposition optimale et sous-optimale des graphes, Notes internes CH-LAAS 73 1 33. [Google Scholar]
  • 8. T. K. PHO - L. LAPIDUS, An optimum Tearing for recycle Systems, AIChE Journ.; Vol. l9, n°6, p. 1170, 1973. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.