Results 21 to 30 of about 8,914 (221)
Digraph Decompositions and Monotonicity in Digraph Searching [PDF]
Theoretical Computer Science, 2008 We consider monotonicity problems for graph searching games. Variants of these games - defined by the type of moves allowed for the players - have been found to be closely connected to graph decompositions and associated width measures such as path- or tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the
Stephan Kreutzer, Sebastian Ordyniak
openaire +6 more sources
Dispelling Myths and Misunderstandings About Defining and Remediating Dyslexia. [PDF]
DyslexiaABSTRACT Despite a strong base of scientifically supported research on dyslexia, pervasive misunderstandings continue, particularly in the United States, where state legislation, instructional practices and parent advocacy intersect in ways that influence how dyslexia is identified and treated.
Austin CR +4 more
europepmc +2 more sources
On Packing Dijoins in Digraphs and Weighted Digraphs
SIAM Journal on Discrete Mathematics, 2023 Let $D=(V,A)$ be a digraph. A dicut is a cut $δ^+(U)\subseteq A$ for some nonempty proper vertex subset $U$ such that $δ^-(U)=\emptyset$, a dijoin is an arc subset that intersects every dicut at least once, and more generally a $k$-dijoin is an arc subset that intersects every dicut at least $k$ times.
Ahmad Abdi +2 more
openaire +4 more sources
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Meister 0001, Jan Arne Telle
openaire +1 more source
A Note on Path Signed Digraphs [PDF]
, 2010 The concept of a line signed digraph is generalized to that of a path signed ...
S. Vijay +5 more
core +1 more source
Double vertex digraphs of digraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yubin Gao, Yanling Shao
openaire +1 more source
Journal of Combinatorial Theory, Series B, 1993 We introduce a generalization of digraphs that are local tournaments. This is the class of in-tournament digraphs---the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs.
Jørgen Bang-Jensen +2 more
openaire +1 more source
Some Remarks On The Structure Of Strong K-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2014 A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense.
Hernández-Cruz César +1 more
doaj +1 more source
IEEE Access, 2020 Many real-world networks consisting of nodes representing (in)tangible asymmetric information or energy flows must be modeled as directed graphs (digraphs).
Chung-Yuan Huang, Wei Chien Benny Chin
doaj +1 more source