dc.contributor.author
Pérez Rosés, Hebert
dc.date.accessioned
2024-12-05T22:37:19Z
dc.date.available
2024-12-05T22:37:19Z
dc.date.issued
2018-10-18T08:36:04Z
dc.date.issued
2018-10-18T08:36:04Z
dc.identifier
https://doi.org/10.5614/ejgta.2014.2.2.9
dc.identifier
http://hdl.handle.net/10459.1/64911
dc.identifier.uri
http://hdl.handle.net/10459.1/64911
dc.description.abstract
This paper discusses the most popular algebraic techniques and computational methods that have
been used to construct large undirected graphs with given degree and diameter.
dc.publisher
Indonesian Combinatorial Society (InaCombS)
dc.publisher
Graph Theory and Applications (GTA) Research Centre
dc.publisher
University of Newcastle (Australia)
dc.publisher
Institut Teknologi Bandung (ITB) (Indonesia)
dc.relation
Reproducció del document publicat a https://doi.org/10.5614/ejgta.2014.2.2.9
dc.relation
Electronic Journal of Graph Theory and Applications, 2014, vol. 2, núm. 2, p. 166–190
dc.rights
cc-by-sa (c) Hebert Pérez-Rosés, 2014
dc.rights
info:eu-repo/semantics/openAccess
dc.rights
http://creativecommons.org/licenses/by-sa/4.0/
dc.subject
Undirected graphs
dc.subject
Graph diameter
dc.subject
Degree/diameter problem
dc.title
Algebraic and computer-based methods in the undirected degree=diameter problem – a brief survey
dc.type
info:eu-repo/semantics/article
dc.type
info:eu-repo/semantics/publishedVersion
