Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Flow network”

Network Flow

Lecture notes series on computing · 1999

Cited by 0

Network Flow

Lecture notes series on computing · 2021

Cited by 0

Network flow

Physics Subject Headings (PhySH) · 2018

Cited by 0

Network Flow

George Pólya, Robert E. Tarjan, Donald R. Woods · Birkhäuser Boston eBooks · 1983

Network flow problems are usually presented in terms of directed graphs. A directed graph is the same as the graphs we’ve been working with, except that each edge is assigned a direction. Another way of stating the distinction is that, whereas in an undirected graph each edge is a pair of vertices, in a directed graph each edge is an ordered pair of vertices.

Cited by 0

Output: Flow Network

Fiore, Nicole M. · Figshare · 2025

Flow Network: Output from hydrological modeling; illustrates ephemeral flow paths for the Borrego Springs Subbasin in California, USA, where thicker lines indicate greater flow accumulation. Threshold used to determine stream initiation: 50,000 cells.------------------------------------------------This file is part of the dataset collection:<br><b>Surface Hydrology Dataset for the Borrego Springs Subbasin: Supporting Data for “Ephemeral flows and vegetation productivity: insights for desert conservation”</b><br><b>Available at:</b> https://doi.org/10.6084/m9.figshare.c.7729628<br>The dataset supports the analyses presented in the following publication:<br>Fiore, N.M., Lulow, M.E., &amp; Huxman, T.E. (2025). <i>Ephemeral flows and vegetation productivity: insights for desert conservation.</i> Ecosphere.<br>If you use this layer in research, publications, or derivative work, please cite the full dataset:<b>Dataset Citation:</b><br>Fiore, Nicole M. (2025). <i>Surface Hydrology Dataset for the Borrego Springs Subbasin: Supporting Data for “Ephemeral flows and vegetation productivity: insights for desert conservation”.</i> figshare. Collection. https://doi.org/10.6084/m9.figshare.c.7729628

Cited by 0Open access

Network flow algorithms

Tarjan, Robert E., Goldberg, Andrew V., Tardos, Eva · OpenGrey (Institut de l'Information Scientifique et Technique) · 1989

Cited by 0

Network Flow Problems

Robert J. Vanderbei · International series in management science/operations research/International series in operations research & management science · 2020

Cited by 1

Network flow analysis

Bruce Potter · Network Security · 2007

When it comes to defending our networks, there are a wide variety of security products to choose from. Firewalls, intrusion detection systems and anti-virus tools are commodity products that are used on thousands of networks around the world. These products have evolved over several decades and are generally a ‘fire and forget’ solution. You install them, you configure them, and you let them do their job. These products are good at stopping known attacks and even do a reasonable job at preventing unknown attacks from being successful.

Cited by 2

Network Flow Model

Willis Marti, Paul Brutch, Udo W. Pooch · 1997

The purpose of this network flow model (NFM) is to assist in providing security for network-attached computing systems. Within the NFM, security is viewed as preventing unwanted information flow between a protected entity (or entities) and everything else. The NFM will allow specific assertions, automated reasoning and formal conclusions about the state of security and what actions are needed to make something secure. The model defines the elements of information that are both necessary and sufficient to describe and reason about the security status of a node and network of nodes. The Network Flow Model slightly refines Ford''s basic architectural levels of security, and adds flow reference points between the layers. The flow reference points are places where one may make assertions about the desired and/or actual information allowed through the reference point. Conceptually, there is a filter at each reference point that allows or denies PDUs to be passed on to the next higher layer.

Cited by 0

Output: Flow Network

Fiore, Nicole M. · Figshare · 2025

Flow Network: Output from hydrological modeling; illustrates ephemeral flow paths for the Borrego Springs Subbasin in California, USA, where thicker lines indicate greater flow accumulation. Threshold used to determine stream initiation: 50,000 cells.------------------------------------------------This file is part of the dataset collection:<br><b>Surface Hydrology Dataset for the Borrego Springs Subbasin: Supporting Data for “Ephemeral flows and vegetation productivity: insights for desert conservation”</b><br><b>Available at:</b> https://doi.org/10.6084/m9.figshare.c.7729628<br>The dataset supports the analyses presented in the following publication:<br>Fiore, N.M., Lulow, M.E., &amp; Huxman, T.E. (2025). <i>Ephemeral flows and vegetation productivity: insights for desert conservation.</i> Ecosphere.<br>If you use this layer in research, publications, or derivative work, please cite the full dataset:<b>Dataset Citation:</b><br>Fiore, Nicole M. (2025). <i>Surface Hydrology Dataset for the Borrego Springs Subbasin: Supporting Data for “Ephemeral flows and vegetation productivity: insights for desert conservation”.</i> figshare. Collection. https://doi.org/10.6084/m9.figshare.c.7729628

Cited by 0Open access

Network information flow

Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000

We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.

Cited by 7,808

Network Flow Control

Steven H. Low · 2003

Abstract Flow control schemes are distributed and asynchronous algorithms to share network resources among competing users. The goal is to share these resources fairly and efficiently, and to provide good QoS, in a stable and scalable manner. In this article, we explain these objectives and implementation constraints. We provide an introduction to mathematical models for understanding and designing such flow control schemes, and illustrate these models using TCP Vages.

Cited by 1

Network Flow Problems

Vassilios S. Vassiliadis, Ehecatl Antonio del Rio‐Chanona, Ye Yuan · Cambridge University Press eBooks · 2020

The chapter focuses on network flow problems, which form a very important part of practical applications. Routing, distribution, and scheduling problems often belong to this category of formulations, while a large number of other optimization problems encountered in diverse areas of applications may contain elements of network flow problems.

Cited by 0