Graph decompositions and factorizing permutations.
Capelle, Christian; Habib, Michel; de Montgolfier, Fabien
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2002)
- Volume: 5, Issue: 1, page 55-70
- ISSN: 1365-8050
Access Full Article
topHow to cite
topCapelle, Christian, Habib, Michel, and de Montgolfier, Fabien. "Graph decompositions and factorizing permutations.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 5.1 (2002): 55-70. <http://eudml.org/doc/122065>.
@article{Capelle2002,
	author = {Capelle, Christian, Habib, Michel, de Montgolfier, Fabien},
	journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
	keywords = {graph algorithms; graph decompositions; modular decomposition},
	language = {eng},
	number = {1},
	pages = {55-70},
	publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
	title = {Graph decompositions and factorizing permutations.},
	url = {http://eudml.org/doc/122065},
	volume = {5},
	year = {2002},
}
TY  - JOUR
AU  - Capelle, Christian
AU  - Habib, Michel
AU  - de Montgolfier, Fabien
TI  - Graph decompositions and factorizing permutations.
JO  - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY  - 2002
PB  - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL  - 5
IS  - 1
SP  - 55
EP  - 70
LA  - eng
KW  - graph algorithms; graph decompositions; modular decomposition
UR  - http://eudml.org/doc/122065
ER  - 
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.
 
 