✦ LIBER ✦

Integer flows

✍ Scribed by D. H. Younger

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 404 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070307

No coin nor oath required. For personal study only.

✦ Synopsis

A k-flow is an assignment of edge directions and integer weights in the range 1, ..., k -1 to the edges of an undirected graph so that at each vertex the flow in is equal to the flow out. This paper gives a polynomial algorithm for finding a 6-flow that applies uniformly to each graph. The algorithm specializes to give a 5-flow for planar graphs.

This paper was written while the author was a Visiting Scholar at Massachusetts Institute of Technology, on sabbatical leave from The University of Waterloo.

📜 SIMILAR VOLUMES

Minimum cycle coverings and integer flow

Minimum cycle coverings and integer flows

✍ Cun-Quan Zhang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB

## Abstract It was conjectured by Fan that if a graph __G__ = (__V,E__) has a nowhere‐zero 3‐flow, then __G__ can be covered by two even subgraphs of total size at most |__V__| + |__E__| ‐ 3. This conjecture is proved in this paper. It is also proved in this paper that the optimum solution of the C

A theorem on integer flows on cartesian

A theorem on integer flows on cartesian products of graphs

✍ Wilfried Imrich; Riste Škrekovski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003

An Integer Lattice Realization of a Lax

An Integer Lattice Realization of a Lax Scheme for Transport Processes in Multiple Component Fluid Flows

✍ Sauro Succi; Hudong Chen; Chris Teixeira; Gino Bella; A De Maio; Kim Molvig 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Lax-Wendroff-like finite-difference representation for the transport of multiple chemical components is formulated via integer variables. This representation ensures exactly the desired conservation laws at all times and achieves low numerical diffusivity. The algorithm requires less memory as compa

Integer Matrix Diagonalization

✍ GEORGE HAVAS; BOHDAN S. MAJEWSKI 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 353 KB

We consider algorithms for computing the Smith normal form of integer matrices. A variety of different strategies have been proposed, primarily aimed at avoiding the major obstacle that occurs in such computations-explosive growth in size of intermediate entries. We present a new algorithm with exce

The Largest Integer Expressible as a Sum

The Largest Integer Expressible as a Sum of Reciprocal of Integers

✍ Hisashi Yokota 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Global mixed-integer dynamic optimizatio

Global mixed-integer dynamic optimization

✍ Benoît Chachuat; Adam B. Singer; Paul I. Barton 📂 Article 📅 2005 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 432 KB 👁 2 views