نتایج جستجو برای: directed path

تعداد نتایج: 291681  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده زبانهای خارجی 1391

since esp received universal attention to smooth the path for academic studies and productions, a great deal of research and studies have been directed towards this area. swales’ (1990) model of ra introduction move analysis has served a pioneering role of guiding many relevant studies and has proven to be productive in terms of helpful guidelines that are the outcome of voluminous productions ...

Journal: :transactions on combinatorics 2013
s. saqaeeyan esmaeil mollaahmadi ali dehghan

the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...

Journal: :SIAM Journal on Discrete Mathematics 2020

Journal: :Journal of Combinatorial Optimization 2021

Abstract In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a graph $$G=(V,E)$$ G = ( V , E ) and set $$T \subseteq V$$ T ...

Journal: :Homology, Homotopy and Applications 2022

We describe various path homology theories constructed for a directed hypergraph. introduce the category of hypergraphs and notion homotopy in this category. Also, we investigate functoriality invariance introduced groups. provide examples computation these

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

2010
Steven Chaplick Marisa Gutierrez Benjamin Lévêque Silvia B. Tondato

We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...

2005
Irene M. Ong Inês de Castro Dutra David Page Vítor Santos Costa

Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we sh...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید