Results 51 to 60 of about 34,890 (227)
Perfect Matching Under Precedence Constraints
Networks, EarlyView.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
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
Networks, EarlyView.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
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
Optimal segmentation of directed graph and the minimum number of feedback arcs
, 2017 The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles.
Xu, Yi-Zhi, Zhou, Hai-Jun
core +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
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
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
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