A divide-and-conquer bound for aggregate's quality and algebraic connectivity. Napov, A. Discrete Mathematics, 340(10):2355-2365, 2017. ![A divide-and-conquer bound for aggregate's quality and algebraic connectivity. [link]](https://bibbase.org/img/filetypes/link.svg "link")
Link Paper bibtex @article{journals/dm/Napov17,
author = {Napov, Artem},
ee = {https://doi.org/10.1016/j.disc.2017.05.003},
interhash = {83f5279a345d852145830f6a090ccae2},
intrahash = {cb8618b865f6730a9f8b2ade5b9d275e},
journal = {Discrete Mathematics},
number = 10,
pages = {2355-2365},
title = {A divide-and-conquer bound for aggregate's quality and algebraic connectivity.},
url = {http://dblp.uni-trier.de/db/journals/dm/dm340.html#Napov17},
volume = 340,
year = 2017
}
Downloads: 0
{"_id":"QRkxyZZDuf9eBqm7H","bibbaseid":"napov-adivideandconquerboundforaggregatesqualityandalgebraicconnectivity-2017","downloads":0,"creationDate":"2017-11-25T00:20:57.231Z","title":"A divide-and-conquer bound for aggregate's quality and algebraic connectivity.","author_short":["Napov, A."],"year":2017,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/artem?items=1000","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Napov"],"firstnames":["Artem"],"suffixes":[]}],"ee":"https://doi.org/10.1016/j.disc.2017.05.003","interhash":"83f5279a345d852145830f6a090ccae2","intrahash":"cb8618b865f6730a9f8b2ade5b9d275e","journal":"Discrete Mathematics","number":"10","pages":"2355-2365","title":"A divide-and-conquer bound for aggregate's quality and algebraic connectivity.","url":"http://dblp.uni-trier.de/db/journals/dm/dm340.html#Napov17","volume":"340","year":"2017","bibtex":"@article{journals/dm/Napov17,\n author = {Napov, Artem},\n ee = {https://doi.org/10.1016/j.disc.2017.05.003},\n interhash = {83f5279a345d852145830f6a090ccae2},\n intrahash = {cb8618b865f6730a9f8b2ade5b9d275e},\n journal = {Discrete Mathematics},\n number = 10,\n pages = {2355-2365},\n title = {A divide-and-conquer bound for aggregate's quality and algebraic connectivity.},\n url = {http://dblp.uni-trier.de/db/journals/dm/dm340.html#Napov17},\n volume = 340,\n year = 2017\n}\n\n","author_short":["Napov, A."],"key":"journals/dm/Napov17","id":"journals/dm/Napov17","bibbaseid":"napov-adivideandconquerboundforaggregatesqualityandalgebraicconnectivity-2017","role":"author","urls":{"Link":"https://doi.org/10.1016/j.disc.2017.05.003","Paper":"http://dblp.uni-trier.de/db/journals/dm/dm340.html#Napov17"},"downloads":0},"search_terms":["divide","conquer","bound","aggregate","quality","algebraic","connectivity","napov"],"keywords":[],"authorIDs":[],"dataSources":["7supHakfuKN3wzsvy"]}