Search results for: GRAPH DECONTAMINATION - Bridge of Knowledge

Search

Search results for: GRAPH DECONTAMINATION
Przykład wyników znalezionych w innych katalogach

Search results for: GRAPH DECONTAMINATION

  • Discussiones Mathematicae Graph Theory

    Journals

    ISSN: 1234-3099 , eISSN: 2083-5892

  • Decontaminating Arbitrary Graphs by Mobile Agents: a Survey

    Publication

    A team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...

    Full text to download in external service

  • Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.

    Publication

    - Year 2008

    W pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.

    Full text to download in external service

  • GRAPHS AND COMBINATORICS

    Journals

    ISSN: 0911-0119 , eISSN: 1435-5914

  • Joanna Raczek dr inż.

    Employment 2003 -- 2019: Faculty of Applied Physics and Mathematics, Gdańsk University of Technology. 2019 - present: Faculty of Electronic, Informatics and Telecominications, Gdańsk University of Technology. Education May 2007: Doctor of Philosophy in Mathematics, University of Gdańsk. Doctoral dissertation: "Paired domination and doubly domination in graphs". Supervisor: dr hab. Jerzy Topp. 2000 -- 2004 Bachelor of Science...

  • EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model

    Publication

    - Year 2018

    The objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...

    Full text available to download

  • Environmental contamination of food

    Publication

    Opisano źródła zanieczyszczeń środowiska oraz obecność w środowisku szeregu związków organicznych i nieorganicznych podejrzewanych o właściwości rakotwórcze. W rozdziale skupiono się na: pestycydach, PCB, WWA, PCDD/F, fenolach, azbeście oraz metalach ciężkich (AS, Be, Cd, Cr, Ni, Pb). Zestawiono typowe stężenia tych zanieczyszczeń w wodzie, deszczu i żywności, omówiono biokumulacje i biowzbogacanie w łańcuchu pokarmowym, a także...

  • Restrained differential of a graph

    Publication

    - Discussiones Mathematicae Graph Theory - Year 2023

    Given a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...

    Full text available to download

  • On the hat problem on a graph

    Publication

    The topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....

    Full text available to download

  • Hat problem on a graph

    Publication

    The topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...

    Full text available to download