Andrei Gagarin
Bounds and algorithms for limited packings in graphs
Gagarin, Andrei; Zverovich, Vadim
Citation
Gagarin, A., & Zverovich, V. (2014, June). Bounds and algorithms for limited packings in graphs. Paper presented at The 9th International Colloquium on Graph Theory and Combinatorics, Grenoble, France
Presentation Conference Type | Conference Paper (unpublished) |
---|---|
Conference Name | The 9th International Colloquium on Graph Theory and Combinatorics |
Conference Location | Grenoble, France |
Start Date | Jun 30, 2014 |
End Date | Jul 4, 2014 |
Publication Date | Jun 1, 2014 |
Peer Reviewed | Not Peer Reviewed |
Keywords | graphs, algorithms, limited packings |
Public URL | https://uwe-repository.worktribe.com/output/816720 |
Additional Information | Title of Conference or Conference Proceedings : The 9th International Colloquium on Graph Theory and Combinatorics |
You might also like
Methods of Graph Decompositions
(2022)
Book
Modern Applications of Graph Theory
(2021)
Book
The likelihood of Braess' paradox in traffic networks
(2018)
Book Chapter
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search