Results 21 to 30 of about 20,401 (60)
, 1996 The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core +1 more source
On disjoint paths in acyclic planar graphs [PDF]
, 2010 We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian.
Naves, Guyslain
core
The structure of strong $k$-quasi-transitive digraphs with large diameters [PDF]
, 2020 Ruixia Wang, Hui Zhang
openalex +1 more source
Global offensive $k$-alliances in digraphs
, 2019 In this paper, we initiate the study of global offensive $k$-alliances in digraphs. Given a digraph $D=(V(D),A(D))$, a global offensive $k$-alliance in a digraph $D$ is a subset $S\subseteq V(D)$ such that every vertex outside of $S$ has at least one in ...
Mojdeh, Doost Ali +2 more
core
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Distance-two labelings of digraphs
, 2004 For positive integers $j\ge k$, an $L(j,k)$-labeling of a digraph $D$ is a function $f$ from $V(D)$ into the set of nonnegative integers such that $|f(x)-f(y)|\ge j$ if $x$ is adjacent to $y$ in $D$ and $|f(x)-f(y)|\ge k$ if $x$ is of distant two to $y ...
Chang, G. J. +3 more
core +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
On the existence and number of
, 2013 Hortensia Galeana‐Sánchez +2 more
openalex +1 more source
The diameter of random Cayley digraphs of given degree
, 2007 We consider random Cayley digraphs of order $n$ with uniformly distributed generating set of size $k$. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as $n\to\infty$ and $k=f(n)$.
C. Wilson +5 more
core +2 more sources
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter
, 2018 Ruixia Wang
openalex +1 more source