Results 61 to 70 of about 48,688 (228)
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
On Some Algorithmic and Structural Results on Flames
Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
Every countable model of set theory embeds into its own constructible universe
, 2014 The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe.
Aczel P. +3 more
core +2 more sources
Vlasov equations on digraph measures [PDF]
Journal of Differential Equations, 2021 C. Kuehn, Chuang Xu
semanticscholar +1 more source
Minimum‐Peak‐Cost Flows Over Time
Networks, Volume 86, Issue 4, Page 389-401, December 2025.ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska +7 more
wiley +1 more source
On cohomology theory of (di)graphs [PDF]
, 2014 To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}.
Huang, An, Yau, Shing-Tung
core
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, 2013 To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs [PDF]
, 2013 A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph $\widetilde{G}$ is a digraph obtained from a sequence of vertex complement operations on $G ...
Joeris, Benson +3 more
core
Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
, 2015 The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the size.
Van Pham, Trung
core +1 more source