Wyniki wyszukiwania dla: EVOLAP GRAPH

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

  Publikacja

  • G. Ewa
  • T. Zawadzka

  - Rok 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...

  Pełny tekst do pobrania w portalu

• Discussiones Mathematicae Graph Theory

  Czasopisma

  ISSN: 1234-3099 , eISSN: 2083-5892

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

  Publikacja

  • H. Furmańczyk
  • A. Kosowski
  • P. Żyliński

  - Rok 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)$.

  Pełny tekst do pobrania w serwisie zewnętrznym

• GRAPHS AND COMBINATORICS

  Czasopisma

  ISSN: 0911-0119 , eISSN: 1435-5914

• Joanna Raczek dr inż.

  Osoby

  Katedra Algorytmów i Modelowania Systemów

  Wykształcenie 1997 -- 2001 Studia inżynierskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2001 -- 2003 Studia magisterskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2000 -- 2004 Studia inżynierskie, Wydział Elektroniki, Informatyki i Telekomunikacji,...

• Graph security testing

  Publikacja

  • T. Gieniusz
  • R. Lewoń
  • M. Małafiejski

  - Journal of Applied Computer Science - Rok 2015

  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...

  Pełny tekst do pobrania w serwisie zewnętrznym

• On the hat problem on a graph

  Publikacja

  • M. Krzywkowski

  - Opuscula Mathematica - Rok 2012

  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....

  Pełny tekst do pobrania w portalu

• Hat problem on a graph

  Publikacja

  • M. Krzywkowski

  - Mathematica Pannonica - Rok 2010

  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...

  Pełny tekst do pobrania w portalu

• Restrained differential of a graph

  Publikacja

  • A. Cabrera-Martinez
  • M. Dettlaff
  • M. Lemańska
  • J. A. Rodriguez-Velazquez

  - Discussiones Mathematicae Graph Theory - Rok 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...

  Pełny tekst do pobrania w portalu

• SOLAP GIS in maritime research

  Publikacja

  • K. Drypczewski
  • A. Stepnowski

  - HYDROACOUSTICS - Rok 2016

  Multidimensional Geographical Information System is a system especially designed to acquire, distribute, analyze and visualize complicated spatio-temporal data. Modern Geographical Information System technology can provide easy-to-use, near real-time solutions to many problems from different areas of research. In the article, authors summarize recent works on Spatial Online Analytical Processing (SOLAP) and multidimensional Geographical...

  Pełny tekst do pobrania w portalu