✦ LIBER ✦

A bidirected generalization of network matrices

✍ Scribed by Gautam Appa; Balázs Kotnyek

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 209 KB
Volume: 47
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple algorithm that proves half-inte

A simple algorithm that proves half-integrality of bidirected network programming

✍ Ethan D. Bolker; Thomas Zaslavsky 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

On the generalization of equicofactor ma

On the generalization of equicofactor matrices

✍ H. Kardestuncer 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

A Generalization of Tutte's Characteriza

A Generalization of Tutte's Characterization of Totally Unimodular Matrices

✍ J.F. Geelen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 386 KB

dedicated to professor w. t. tutte on the occasion of his eightieth birthday We characterize the symmetric (0, 1)-matrices that can be signed symmetrically so that every principal submatrix has determinant 0, \1. This characterization generalizes Tutte's famous characterization of totally unimodula

Bidirectional A* search on time-dependen

Bidirectional A* search on time-dependent road networks

✍ Giacomo Nannicini; Daniel Delling; Dominik Schultes; Leo Liberti 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB

Generation of constituent matrices

✍ V. V. Bapeswara Rao; P. A. D. Jyothirao; V. G. K. Murti 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

Closest Matrices in the Space of General

Closest Matrices in the Space of Generalized Doubly Stochastic Matrices

✍ Raja Nicolas Khoury 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let ⍀ denote the set of generalized doubly stochastic n = n real matrices; that n is matrices whose row and column sums are 1. The research in this paper concerns finding the closest matrix B\* in ⍀ to a given matrix A in M , the space of n = n n n