On classes of graphs with strongly sublinear separators

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385406" target="_blank" >RIV/00216208:11320/18:10385406 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.ejc.2018.02.032" target="_blank" >https://doi.org/10.1016/j.ejc.2018.02.032</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2018.02.032" target="_blank" >10.1016/j.ejc.2018.02.032</a>

Result language
angličtina
Original language name
On classes of graphs with strongly sublinear separators
Original language description
For real numbers c, epsilon > 0, let G(c,epsilon) denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c vertical bar V(H)vertical bar(1-epsilon). A class g of graphs has strongly sublinear separators if G subset of G(c,epsilon) for some c, epsilon > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in G(c,epsilon): there exist c' > 0 such that for each input graph G, this algorithm in polynomial time determines either that G is an element of G(c',epsilon 2/160), or that G is not an element of G(c,epsilon).
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)