dc.contributor.advisor | Tancer, Martin | |
dc.creator | Madaj, Pavel | |
dc.date.accessioned | 2022-04-06T11:49:27Z | |
dc.date.available | 2022-04-06T11:49:27Z | |
dc.date.issued | 2021 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11956/148284 | |
dc.description.abstract | V tejto práci skúmame spôsoby ako rozšírit' grafy na nadgrafy, ktoré sú vrcholovo tranzitívne. Predstavíme systém šablón pre konštrukciu týchto nadgrafov. Tento systém využujeme na konštrukciu vrcholovo tranzitívnych nadgrafov exponenciálnej vel'kosti pre všeobecné grafy a nadgrafov kvadratickej vel'kosti pre bipartitné grafy. Pre všeobecné grafy dokážeme kvadratickú dolnú medz. Načrtneme aj prístup, ktorý by mohol viest' k preklenutiu medzery v časovej zložitosti medzi problémom grafového izomorfizmu a problémom rozpoznávania vrcholovo tranzitívnych grafov. 1 | cs_CZ |
dc.description.abstract | In this thesis we explore ways to extend graphs to supergraphs that are vertex-transitive. We introduce a template system for their construction. This system is used to provide a construction of vertex-transitive supergraphs of exponential size for general graphs and of quadratic size for bipartite graphs. For general graphs we also provide a quadratic lower bound. We also sketch an approach that could lead to bridging the time complexity gap between the graph isomorphism problem and the problem of recognizing vertex-transitive graphs. 1 | en_US |
dc.language | English | cs_CZ |
dc.language.iso | en_US | |
dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
dc.subject | graph theory|symmetry|automorphisms|computational complexity|graph isomorphism | en_US |
dc.subject | teorie grafů|symetrie|automorfismy|výpočetní zložitost|grafový isomorfizmus | cs_CZ |
dc.title | Vertex-transitive Supergraphs | en_US |
dc.type | bakalářská práce | cs_CZ |
dcterms.created | 2021 | |
dcterms.dateAccepted | 2021-09-10 | |
dc.description.department | Department of Applied Mathematics | en_US |
dc.description.department | Katedra aplikované matematiky | cs_CZ |
dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
dc.description.faculty | Faculty of Mathematics and Physics | en_US |
dc.identifier.repId | 212808 | |
dc.title.translated | Vrcholově tranzitivní nadgrafy | cs_CZ |
dc.contributor.referee | Hušek, Radek | |
thesis.degree.name | Bc. | |
thesis.degree.level | bakalářské | cs_CZ |
thesis.degree.discipline | Obecná informatika | cs_CZ |
thesis.degree.discipline | General Computer Science | en_US |
thesis.degree.program | Computer Science | en_US |
thesis.degree.program | Informatika | cs_CZ |
uk.thesis.type | bakalářská práce | cs_CZ |
uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra aplikované matematiky | cs_CZ |
uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Applied Mathematics | en_US |
uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
uk.faculty-abbr.cs | MFF | cs_CZ |
uk.degree-discipline.cs | Obecná informatika | cs_CZ |
uk.degree-discipline.en | General Computer Science | en_US |
uk.degree-program.cs | Informatika | cs_CZ |
uk.degree-program.en | Computer Science | en_US |
thesis.grade.cs | Velmi dobře | cs_CZ |
thesis.grade.en | Very good | en_US |
uk.abstract.cs | V tejto práci skúmame spôsoby ako rozšírit' grafy na nadgrafy, ktoré sú vrcholovo tranzitívne. Predstavíme systém šablón pre konštrukciu týchto nadgrafov. Tento systém využujeme na konštrukciu vrcholovo tranzitívnych nadgrafov exponenciálnej vel'kosti pre všeobecné grafy a nadgrafov kvadratickej vel'kosti pre bipartitné grafy. Pre všeobecné grafy dokážeme kvadratickú dolnú medz. Načrtneme aj prístup, ktorý by mohol viest' k preklenutiu medzery v časovej zložitosti medzi problémom grafového izomorfizmu a problémom rozpoznávania vrcholovo tranzitívnych grafov. 1 | cs_CZ |
uk.abstract.en | In this thesis we explore ways to extend graphs to supergraphs that are vertex-transitive. We introduce a template system for their construction. This system is used to provide a construction of vertex-transitive supergraphs of exponential size for general graphs and of quadratic size for bipartite graphs. For general graphs we also provide a quadratic lower bound. We also sketch an approach that could lead to bridging the time complexity gap between the graph isomorphism problem and the problem of recognizing vertex-transitive graphs. 1 | en_US |
uk.file-availability | V | |
uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra aplikované matematiky | cs_CZ |
thesis.grade.code | 2 | |
uk.publication-place | Praha | cs_CZ |
uk.thesis.defenceStatus | O | |