Results 51 to 60 of about 48,688 (228)
Penyelesaian masalah biaya minimal pada jaringan circulatory dengan algoritma out-of-kilter [PDF]
, 2000 Permasalahan jaringan biaya minimal merupakan permasalahan program Tinier yang disajikan ke dalam bentuk digraph atau network yang telah diketahui kapasitas dan bobot dari masing-masing arcnya.
Santoso , Haryo
core
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph [PDF]
Embedded Systems and Applications, 2013 Cutwidth of a digraph is a width measure introduced by Chudnovsky, Fradkin, and Seymour [4] in connection with development of a structural theory for tournaments, or more generally, for semi-complete digraphs.
Fedor V. Fomin, Michał Pilipczuk
semanticscholar +1 more source
Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 100-116, 10 January 2026.ABSTRACT This study develops a solution to the distributed SE(d) formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 more
wiley +1 more source
Countable connected-homogeneous digraphs [PDF]
, 2013 A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph.
Hamann, Matthias
core
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
Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints
Discussiones Mathematicae Graph Theory, 2022 Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.
Lyu Zhenhua
doaj +1 more source
Energy Science &Engineering, Volume 14, Issue 1, Page 236-256, January 2026.The study analyzes barriers to electric vehicle growth in India using DEMATEL and ANP. It distinguishes cause‐and‐effect barriers and ranks them. Major barriers include poor charging infrastructure and high costs. ABSTRACT This study employs a hybrid technique based on the Decision‐Making Trial Evaluation Laboratory (DEMATEL), Analytic Network Process (
Sanjeev Kumar +6 more
wiley +1 more source
Ratio Mathematica, 2022 A Digraph D consists of two finite sets ), where denotes the vertex set and denotes the arc set. For vertices if there exists a directed path from to then is said to be reachable from and vice versa.
V Mahalakshmi, B Vijaya Praba, K Palani
doaj +1 more source
Unpacking Entrepreneurial Ecosystem Elements: Insights Into Drivers of Entrepreneurial Activity
Thunderbird International Business Review, Volume 68, Issue 1, Page 3-15, January/February 2026.ABSTRACT Thriving entrepreneurial ecosystems (EEs) are instrumental in new enterprise creation and growth, as they provide vital support for entrepreneurial activity. However, as this support may be context‐specific, the existing literature has yet to capture the contextual factors that shape the contributions of EEs.
Mohamed Yacine Haddoud +4 more
wiley +1 more source
On the causal interpretation of acyclic mixed graphs under multivariate normality [PDF]
, 2013 In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables.
Drton, Mathias +2 more
core