Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2014-10-01
|
| Rangatū: | Electronic Journal of Graph Theory and Applications |
| Ngā marau: | |
| Urunga tuihono: | http://www.ejgta.org/index.php/ejgta/article/view/96 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|