Construction techniques for digraphs with minimum diameter
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919798" target="_blank" >RIV/49777513:23520/13:43919798 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45278-9_28" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45278-9_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45278-9_28" target="_blank" >10.1007/978-3-642-45278-9_28</a>
Alternative languages
Result language
angličtina
Original language name
Construction techniques for digraphs with minimum diameter
Original language description
We consider the so-called order/degree problem, that is, to determine the smallest diameter of a digraph given order and maximum out-degree. There is no general efficient algorithm known for the construction of such optimal digraphs but various construction techniques for digraphs with minimum diameter have been proposed. In this paper, we survey the known techniques.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Combinatorial algorithms : 24th international workshop, Iwoca 2013 : Rouen, France, July 10-12, 2013
ISBN
978-3-642-45277-2
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
327-336
Publisher name
Springer
Place of publication
Berlin
Event location
Rouen
Event date
Jun 10, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—