Un algorithme heuristique de décomposition d'un graphe

Maurice Milgram; Bernard Dubuisson

RAIRO - Operations Research - Recherche Opérationnelle (1977)

  • Volume: 11, Issue: 2, page 175-199
  • ISSN: 0399-0559

How to cite

top

Milgram, Maurice, and Dubuisson, Bernard. "Un algorithme heuristique de décomposition d'un graphe." RAIRO - Operations Research - Recherche Opérationnelle 11.2 (1977): 175-199. <http://eudml.org/doc/104660>.

@article{Milgram1977,
author = {Milgram, Maurice, Dubuisson, Bernard},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {Maximum Flow Method; Algorithm; Decomposing a System; Subsystems; Partition; Eigenvectors; Cliques; Coloration; Minimum Groups; Exchanges},
language = {fre},
number = {2},
pages = {175-199},
publisher = {EDP-Sciences},
title = {Un algorithme heuristique de décomposition d'un graphe},
url = {http://eudml.org/doc/104660},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Milgram, Maurice
AU - Dubuisson, Bernard
TI - Un algorithme heuristique de décomposition d'un graphe
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 2
SP - 175
EP - 199
LA - fre
KW - Maximum Flow Method; Algorithm; Decomposing a System; Subsystems; Partition; Eigenvectors; Cliques; Coloration; Minimum Groups; Exchanges
UR - http://eudml.org/doc/104660
ER -

References

top
  1. 1. C. BERGE, Théorie des graphes et ses applications, Dunod, 1956. Zbl0121.40101MR102822
  2. 2. C. BERGE, Graphes et Hypergraphes, Dunod, 1970. Zbl0213.25702MR357173
  3. 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. 
  4. 4. G. I. ORLOVA, Optimum partition of a graph into several subgraphs Engineering Cybernetic, Vol. 10, 103, 1972. MR325454
  5. 5. F. Luccio - M. SAMI, On the decomposition of networks into minimally interconnected subnetworks, IEE transactions on Circuit Theory, CT-16, Vol. 2, 1972. MR242579
  6. 6. B. W. KERNIGHAN, An effective heuristic procedure for partioning graphs, BSTJ, Vol 49. 291, 1970. Zbl0333.05001
  7. 7. M. RICHETIN, Algorithme de décomposition optimale et sous-optimale des graphes, Notes internes CH-LAAS 73 1 33. 
  8. 8. T. K. PHO - L. LAPIDUS, An optimum Tearing for recycle Systems, AIChE Journ.; Vol. l9, n°6, p. 1170, 1973. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.