Filters
Logspace reduction of directed reachability for bounded genus graphs to the planar case
We show that reachability in directed graphs embedded on a fixed surface of arbitrary genus is logspace-reducible to reachability in directed graphs embedded in the plane....
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On maximal finite antichains in the homomorphism order of directed graphs
On maximal finite antichains in the homomorphism order of directed graphs...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Rankings of directed graphs
Rankings of directed graphs...
BA - Obecná matematika
- 1999 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
DAG-width - Connectivity Measure for Directed Graphs
Tree-width is a very useful connectivity measure for undirected graphs. We propose a new definition, called DAG-width, for directed graphs which measures how close a graph is to a directed acyclic grap...
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Algorithmic Properties of Sparse Digraphs
notions of directed bounded expansion and nowhere crownfulness on directed graphs, introduced by Kreutzer and Tazari [48]. The classes of directed graphs having those properties are very general classes o...
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 DAG-width of directed graphs
of this game to directed graphs and show that monotone strategies in the game yield a measure, called DAG-width, that can be seen to describe how close a directed graph is to a directed acyclic graph<...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
We study the parameterized complexity of the directed variant of the classical Steiner Tree problem on various classes of directed sparse graphs. While to show this result break down on directed planar graphs
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Directed elimination games
on undirected graphs, corresponding width measures for directed graphs have not yet fulfilled their promise for broad algorithmic applications on directed graphs. OneWhile tools from structural graph<...
IN - Informatika
- 2016 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Signed domination numbers of directed graphs
The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of...
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Serialization of Transactions: A Graph-Theoretic Approach
We have shown that the function, which maps each schedule of transaction to its serialization graph, is a surjection but it is not an injection. Using the probabilistic argument, we have shown that almost all directed graphs
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 57 377