# Minimum eccentricity multicast trees.

Krumme, David; Fragopoulou, Paraskevi

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

- Volume: 4, Issue: 2, page 157-172 p.
- ISSN: 1365-8050

## Access Full Article

top## How to cite

topKrumme, David, and Fragopoulou, Paraskevi. "Minimum eccentricity multicast trees.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 157-172 p.. <http://eudml.org/doc/121680>.

@article{Krumme2001,

author = {Krumme, David, Fragopoulou, Paraskevi},

journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},

keywords = {algorithm; communications; graph; network},

language = {eng},

number = {2},

pages = {157-172 p.},

publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},

title = {Minimum eccentricity multicast trees.},

url = {http://eudml.org/doc/121680},

volume = {4},

year = {2001},

}

TY - JOUR

AU - Krumme, David

AU - Fragopoulou, Paraskevi

TI - Minimum eccentricity multicast trees.

JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

PY - 2001

PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD

VL - 4

IS - 2

SP - 157

EP - 172 p.

LA - eng

KW - algorithm; communications; graph; network

UR - http://eudml.org/doc/121680

ER -

## NotesEmbed ?

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