Search results for: DIGRAPH - Bridge of Knowledge

Search

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

Search results for: DIGRAPH

  • Discussiones Mathematicae Graph Theory

    Journals

    ISSN: 1234-3099 , eISSN: 2083-5892

  • Inner derivations of special subrings of matrix rings and outerplanar digraphs.

    Tematem artykułu jest specjalny podpierścień pierścienia macierzy wyznaczony przez relację oraz digraf reprezentujący tę relację. Rozważane są takie relacje, dla których reprezentujące je digrafy są zewnętrznie planarne. W tym przypadku zostały udowodnione warunki konieczne i wystarczające na to, aby różniczkowanie pierścienia było wewnętrzne.

  • 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

  • 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

  • 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 to download in external service

  • Graph security testing

    Set S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...

    Full text to download in external service

  • 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

  • The Snow Team Problem

    Publication

    - Year 2017

    We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...

    Full text to download in external service

  • Koala graph coloring library: an open graph coloring library for real-world applications

    Publication

    Pomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....

    Full text to download in external service

  • Forwarding and optical indices of a graph

    Publication

    W pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.

    Full text available to download