Results 11 to 20 of about 17,014 (265)
Circular Flows in Planar Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular $(2+\frac{2}{k})$-flow.
Daniel W. Cranston, Jiaao Li
openaire +3 more sources
Exceedance probability of characteristic flows in Poland [PDF]
Acta Scientiarum Polonorum. Formatio Circumiectus, 2023 Aim of the study: The goals of this paper are: to determine the empirical exeedance probability of the characteristic flows Qchar (SNQ, WNQ, NSQ, SSQ, WSQ, NWQ and SWQ) in Poland; to link the flows Qchar with quantiles Qp and to examine the relationship
Katarzyna Baran-Gurgul
doaj +1 more source
Flows in One-Crossing-Minor-Free Graphs
Journal of Graph Algorithms and Applications, 2013 We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given, we show that a ...
Erin Wolf Chambers, David Eppstein
doaj +1 more source
Additive bases and flows in graphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number $p$, there is a constant $c$ such that for any $n$, the union (with repetition) of the vectors of any family of $c$ linear bases of $\mathbb{Z}_p^n$ forms an additive basis of $\mathbb{Z}_p^n$ (i.e.
Esperet, Louis +3 more
openaire +5 more sources
Selected characteristics of hydrological drought progression in the upper Warta river catchment [PDF]
Acta Scientiarum Polonorum. Formatio Circumiectus, 2018 Low-flows are an important component of the river regime. Their identification advances our knowledge about the formation of water resources in drought conditions.
Malwina Kozek, Edmund Tomaszewski
doaj +1 more source
GRAPH MODEL OF VEHICLE CONFLICT INTERACTION AT VARIOUS CROSSROADS
Наука и техника, 2018 The paper introduces a new notion that is a graph of crossroad transport flows. It has been shown that the given graph serves as a unification of conflict graphs. The paper provides numerical characteristics of graphs on conflict interaction of transport
D. V. Kapskiy, V. N. Shutst, P. A. Pegin
doaj +1 more source
Interpreting Message Flow Graphs [PDF]
Formal Aspects of Computing, 1995 Abstract We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess communication that Program Dependence Graphs play for control flow in parallel processes. MFGs have been used to analyse parallel code, and are closely related to Message Sequence Charts and Time Sequence Diagrams in telecommunications systems ...
Ladkin, Peter B., Leue, Stefan
openaire +2 more sources
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source
HGNM: Long-Short Term Flow Graph and Hybrid Graph Neural Network-based Saturation Attack Detection Method [PDF]
Jisuanji gongchengThe separation of the control and data planes in Software Defined Network (SDN) enables its widespread application in large-scale network scenarios such as data centers, the Internet of Things (IoT), and cloud networks.
LI Jiasong, CUI Yunhe, SHEN Guowei, GUO Chun, CHEN Yi, JIANG Chaohui
doaj +1 more source
Normalisation Control in Deep Inference via Atomic Flows [PDF]
Logical Methods in Computer Science, 2008 We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to
Alessio Guglielmi, Tom Gundersen
doaj +1 more source