A characterization of hypergraphs generated by arborescences
Kybernetika (1979)
- Volume: 15, Issue: 6, page (403)-407
- ISSN: 0023-5954
Access Full Article
top
How to cite
topSysło, Maciej M.. "A characterization of hypergraphs generated by arborescences." Kybernetika 15.6 (1979): (403)-407. <http://eudml.org/doc/28398>.
@article{Sysło1979,
author = {Sysło, Maciej M.},
journal = {Kybernetika},
keywords = {hypergraphs; arborescences; cluster analysis},
language = {eng},
number = {6},
pages = {(403)-407},
publisher = {Institute of Information Theory and Automation AS CR},
title = {A characterization of hypergraphs generated by arborescences},
url = {http://eudml.org/doc/28398},
volume = {15},
year = {1979},
}
TY - JOUR
AU - Sysło, Maciej M.
TI - A characterization of hypergraphs generated by arborescences
JO - Kybernetika
PY - 1979
PB - Institute of Information Theory and Automation AS CR
VL - 15
IS - 6
SP - (403)
EP - 407
LA - eng
KW - hypergraphs; arborescences; cluster analysis
UR - http://eudml.org/doc/28398
ER -
References
top- C. Berge, Graphs and hypergraphs, North-Holland, Amer. Elsevier, Amsterdam 1973. (1973) Zbl0254.05101MR0357172
- M. Karoński Z. Palka, On Marczewski-Steinhaus type distance between hypergraphs, Zastosow. Matem. 16 (1977), 47-57. (1977) MR0476583
- D. E. Knuth, The art of computer programming. Vol. 1: Fundamental algorithms, Reading (Mass.) 1968, 309. (1968) Zbl0191.17903MR0378456
NotesEmbed ?
topYou 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.