15 research outputs found

    Műszaki informatikai problémákhoz kapcsolódó diszkrét matematikai modellek vizsgálata = Discrete mathematical models related to problems in informatics

    Get PDF
    Diszkrét matematikai módszerekkel strukturális és kvantitatív összefüggéseket bizonyítottunk; algoritmusokat terveztünk, komplexitásukat elemeztük. Az eredmények a gráfok és hipergráfok elméletéhez, valamint on-line ütemezéshez kapcsolódnak. Néhány kiemelés: - Pontosan leírtuk azokat a szerkezeti feltételeket, amelyeknek teljesülni kell ahhoz, hogy egy kommunikációs hálózatban és annak minden összefüggő részében legyen olyan, megadott típusú összefüggő részhálózat, ahonnan az összes többi elem közvetlenül elérhető. (A probléma két évtizeden át megoldatlan volt.) - Aszimptotikusan pontos becslést adtunk egy n-elemű alaphalmaz olyan, k-asokból álló halmazrendszereinek minimális méretére, amelyekben minden k-osztályú partícióhoz van olyan halmaz, ami az összes partíció-osztályt metszi. (Nyitott probléma volt 1973 óta, több szerző egymástól függetlenül is felvetette.) - Halmazrendszerek partícióira az eddigieknél általánosabb modellt vezettünk be, megvizsgáltuk részosztályainak hierarchikus szerkezetét és hatékony algoritmusokat adtunk. (Sok alkalmazás várható az erőforrás-allokáció területén.) - Kidolgoztunk egy módszert, amellyel lokálisan véges pozíciós játékok nyerő stratégiája megtalálható mindössze lineáris méretű memória használatával. - Félig on-line ütemezési algoritmusokat terveztünk (kétgépes feladatra, nem azonos sebességű processzorokra), amelyeknek versenyképességi aránya bizonyítottan jobb, mint ami a legjobb teljesen on-line módszerekkel elérhető. | Applying discrete mathematical methods, we proved structural and quantitative relations, designed algorithms and analyzed their complexity. The results deal with graph and hypergraph theory and on-line scheduling. Some selected ones are: - We described the exact structural conditions which have to hold in order that an intercommunication network and each of its connected parts contain a connected subnetwork of prescribed type, from which all the other nodes of the network can be reached via direct link. (This problem was open for two decades.) - We gave asymptotically tight estimates on the minimum size of set systems of k-element sets over an n-element set such that, for each k-partition of the set, the set system contains a k-set meeting all classes of the partition. (This was an open problem since 1973, raised by several authors independently.) - We introduced a new model, more general than the previous ones, for partitions of set systems. We studied the hierarchic structure of its subclasses, and designed efficient algorithms. (Many applications are expected in the area of resource allocation.) - We developed a method to learn winning strategies in locally finite positional games, which requires linear-size memory only. - We designed semi-online scheduling algorithms (for two uniform processors of unequal speed), whose competitive ratio provably beats the best possible one achievable in the purely on-line setting

    The Complexity of Surjective Homomorphism Problems -- a Survey

    Get PDF
    We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which remain of open complexity

    On rainbow-free colourings of uniform hypergraphs

    Full text link
    We study rainbow-free colourings of kk-uniform hypergraphs; that is, colourings that use kk colours but with the property that no hyperedge attains all colours. We show that p=(k1)(lnn)/np^*=(k-1)(\ln n)/n is the threshold function for the existence of a rainbow-free colouring in a random kk-uniform hypergraph

    Chromatic Polynomials of Some Mixed Hypergraphs

    Get PDF
    Motivated by a recent result of M. Walter [Electron. J. Comb. 16, No. 1, Research Paper R94, 16 p. (2009; Zbl 1186.05059)] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into blocks, defined via chains. Further, using an algebra software package such as Maple, one can use the basic formulae and process demonstrated in this paper to generate the chromatic polynomials for any linear mixed hypercycle, unicyclic mixed hypercyle, mixed hypercactus and multi-bridge mixed hypergraph. We also give the chromatic polynomials of several examples in illustration of the process including the formulae for some mixed sunflowers

    Surjective H-Colouring over reflexive digraphs

    Get PDF
    The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs. Chen (2014) proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if H has the property that all of its polymorphisms are essentially unary. We give the first concrete application of his result by showing that every endo-trivial reflexive digraph H has this property. We then use the concept of endo-triviality to prove, as our main result, a dichotomy for Surjective H-Colouring when H is a reflexive tournament: if H is transitive, then Surjective H-Colouring is in NL; otherwise, it is NP-complete. By combining this result with some known and new results, we obtain a complexity classification for Surjective H-Colouring when H is a partially reflexive digraph of size at most 3

    EUROCOMB 21 Book of extended abstracts

    Get PDF
    corecore