Free Access
Issue
RAIRO-Oper. Res.
Volume 15, Number 2, 1981
Page(s) 109 - 117
DOI https://doi.org/10.1051/ro/1981150201091
Published online 06 February 2017
  • 1. G. CHATY, M. CHEIN, P. MARTIN et G. PETOLLA, Number of Jumps and Ordered Matchings in Bipartite Digraphs, Rapport de rech., n° 5, 1978, Groupe de recherche, n° 22, C.N.R.S. [Google Scholar]
  • 2. M. CHEIN et M. HABIB, Jumps in Digraphs and Partial Orders: an Introduction. Annals of Discrete Math., vol. 9, 1980. p. 189-194. [MR: 597371] [Zbl: 0445.05048] [Google Scholar]
  • 3. M. HABIB, Partition en chemins des sommets et sauts dans les graphes sans circuit, Thèse, Université Paris-VI, 1975. [Google Scholar]
  • 4. G. HUET, Confluent Reductions: Abstract Properties and applications to Term Rewriting Systems, J.A.C.M. vol. 27, 1980, p. 797-821. [MR: 594700] [Zbl: 0458.68007] [Google Scholar]
  • 5. G. LAMBERT, Indice de C-partition des sommets d'un graphe, algorithmes derecouvrement, Thèse, Université Paris-Vl, 1975. [Google Scholar]
  • 6. P. C. LIU et R. C. GELDMACHER, Graph Reducibility, Utilitas Math., Congres. Num., vol. 15, 1976, p. 433-445. [MR: 550129] [Zbl: 0363.05047] [Google Scholar]
  • 7. B. ROSEN, Tree-Manipulating Systems and Church-Rosser Property, J.A.C.M., vol. 20, 1973, p. 160-187. [MR: 331850] [Zbl: 0267.68013] [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.