Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Tůma, Vojtěch"'
Autor:
Tůma, Vojtěch
In this thesis we study sparse classes of graphs and their properties usable for design of algorithms and data structures. Our specific focus is on the con- cepts of bounded expansion and tree-depth, developed in recent years mainly by J. Nešetřil
Externí odkaz:
http://www.nusl.cz/ntk/nusl-321382
Autor:
Gajarsky, Jakub, Hlineny, Petr, Kaiser, Tomas, Kral, Daniel, Kupec, Martin, Obdrzalek, Jan, Ordyniak, Sebastian, Tuma, Vojtech
Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there exist first order convergent sequences of graphs with no limit modeli
Externí odkaz:
http://arxiv.org/abs/1504.08122
We present a dynamic data structure for representing a graph $G$ with tree-depth at most $D$. Tree-depth is an important graph parameter which arose in the study of sparse graph classes. The structure allows addition and removal of edges and vertices
Externí odkaz:
http://arxiv.org/abs/1307.2863
Autor:
Dvorak, Zdenek, Tuma, Vojtech
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded size as an induced subgraph of G. The queries are answered in constant t
Externí odkaz:
http://arxiv.org/abs/1209.0375
Publikováno v:
Czech Radiology / Ceska Radiologie; Dec2022, Vol. 76 Issue 4, p222-230, 9p
Autor:
Tůma, Vojtěch
"The comparison of the two biggest football transfers from the Czech league in Deník Sport and MF Dnes" deals with the departures of Tomáš Rosický from Sparta Prague to Borussia Dortmund in 2001 and Tomáš Souček from Slavia Prague to West of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::00dfad84dd9e210e5c9fb4da19efc676
http://www.nusl.cz/ntk/nusl-447263
http://www.nusl.cz/ntk/nusl-447263
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tůma, Vojtěch
In this thesis we study sparse classes of graphs and their properties usable for design of algorithms and data structures. Our specific focus is on the con- cepts of bounded expansion and tree-depth, developed in recent years mainly by J. Nešetřil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::853f79aad1b1e25cdea9d69f679f5630
http://www.nusl.cz/ntk/nusl-321382
http://www.nusl.cz/ntk/nusl-321382
Autor:
Tůma, Vojtěch
In this thesis we deal with extending a 4-coloring of a cycle into the rest of the graph. We prove that for plane 3-colorable graphs such that every face except the outer face O is a triangle and O has length 4 or 5, the question of extendability of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::085d0185225c98ff616943b88da80cf0
http://www.nusl.cz/ntk/nusl-314553
http://www.nusl.cz/ntk/nusl-314553