Partition expanders
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F14%3A00434518" target="_blank" >RIV/67985840:_____/14:00434518 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2014.325" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.STACS.2014.325</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2014.325" target="_blank" >10.4230/LIPIcs.STACS.2014.325</a>
Alternative languages
Result language
angličtina
Original language name
Partition expanders
Original language description
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. We show that for some range of parameters, to be apartition expander a random graph needs exponentially smaller degree than any expander would require in order to achieve similar expanding properties.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
ISBN
978-3-939897-65-1
ISSN
1868-8969
e-ISSN
—
Number of pages
12
Pages from-to
325-336
Publisher name
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
Place of publication
Dagstuhl
Event location
Lyon
Event date
Mar 5, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—