Filters
Moore bound for mixed networks
Mixed graphs contain both undirected as well as directed links between vertices and therefore are an interesting model for interconnection communication networks. In this paper, we establish the Moore bound for mixed graphs...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Algorithmic Properties of Sparse Digraphs
by Negetfil and Ossona de Mendez as structural measures for undirected graphs, have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere c...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
The Parameterized Complexity of Oriented Colouring
graphs, the oriented colouring problem is not directly transferable to undirected graphs. In the article we look at the parameterized complexity of computing the oriented colouring of digraphs with bounded undirected
BD - Teorie informace
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Conditional Independence and Basic Markov Properties
. The traditional graphical models, namely those ascribed to undirected graphs (UGs) and directed acyclic graphs (DAGs), can be interpreted as special cases of statistical basic types of graphs is also given.n......
Pure mathematics
- 2018 •
- C
Rok uplatnění
C - Kapitola v odborné knize
A convenient graph connectedness for digital imagery
In a simple undirected graph, we introduce a special connectedness induced by a set of paths of length 2. We focus on the 8-adjacency graph (with the vertex set Z in the graph. For this connectedness, we prove a di...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Safety in logistic transport chains using theory of graphs
This article focuses on the elementary explanation of safety requirement in logistic transport chains. One of ways to accomplish safety in these chains is searching the most reliable paths in the transport networks. In this article there is the expla...
BB - Aplikovaná statistika, operační výzkum
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
and the undirected versions are W[2]-hard on general graphs, and hence unlikely tobe fixed parameter tractable (FPT). The undirected Steiner Tree problem becomes FPT when restricted to sparse classes of graphs suc...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On the maximum-entropy extensions of probability measures over undirected graphs.
Annotation not available...
BD - Teorie informace
- 1994 •
- D
Rok uplatnění
D - Stať ve sborníku
Number theoretical views on resonant Rossby wave triads: graphs with vertices on quartics
The paper provides new insights and new results for resonance triads of Rossby waves which are described as solutions of a Diophantine equation: we have derived a new description using undirected graphs and we have proven their most...
Pure mathematics
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modifed by inserting or deleting edges undirected graphs the cover ...
BA - Obecná matematika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 7 444