Published in Open Computer Science
In this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for solving the problem exist in the literature and most of them are based on the backtracking appr...
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by heat equations on the edges supplemented with Robin like boundary conditions at the vertices modeling exchang...
Max-plus algebra spada med tista področja matematike, katerih razvoj se je začel relativno pozno, zato postaja vse bolj zanimiva za raziskovalce, novejše raziskave na tem področju pa kažejo tudi na njeno večstransko uporabnost. Ker ima zaradi lastnosti svojih operacij prednost pri reševanju nekaterih problemov, so jo uporabili tudi pri sestavi vozn...
V této práci se zabýváme reprezentací grafonů pomocí neuronových sítí. Grafony jsou funkce zachycující strukturu velkých grafů. Neuronové sítě jsou v některých případech dobrými aproximacemi funkcí, proto se pokoušíme je aplikovat na aproximaci grafonů. Za tímto cílem jsme v rámci práce vyvinuli učící algoritmus založený na spádových metodách, kter...
Published in Royal Society Open Science
Recent wildfire events, in the United States (USA) and around the world, have resulted in thousands of homes destroyed and many lives lost, leaving communities and policy makers, once again, with the question as to how to manage wildfire risk. This is particularly important given the prevalent trend of increased fire frequency and intensity. Curren...
Published in Journal of Applied and Industrial Mathematics
Abstract We study a version of the graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-clustering problem and the related semi-supervised problem. I...
In search and rescue missions, time is an important factor; fast navigation and quickly acquiring situation awareness might be matters of life and death. Hence, the use of robots in such scenarios has been restricted by the time needed to explore and build a map. One way to speed up exploration and mapping is to reason about unknown parts of the en...
Navigational charts play a vital role in a ship's safety while navigating the seas, rivers or lakes. With most of the features and obstructions being out of sight -below sea-level - these charts are more critical than e.g. topographic maps. For routing but also positioning, depth information is a key aspect on these charts. This depth information i...
Published in Problems of Information Transmission
A graph G is called a fractional (g, f)-covered graph if for any e ∈ E(G), G admits a fractional (g, f)-factor covering e. A graph G is called a fractional (g, f, n)-critical covered graph if for any S ⊆ V(G) with ∣S∣ = n, G − S is a fractional (g, f)-covered graph. A fractional (g, f, n)-critical covered graph is said to be a fractional (a, b, n)-...
