✦ LIBER ✦

On weighted directed graphs

✍ Scribed by R.B. Bapat; D. Kalita; S. Pati

Book ID: 113772013
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 467 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.06.035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Consensus Seeking Over Random Weighted D

Consensus Seeking Over Random Weighted Directed Graphs

✍ Porfiri, M.; Stilwell, D.J. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 242 KB

On an asymptotic optimization problem in

On an asymptotic optimization problem in finite, directed, weighted graphs

✍ I.L. Traiger; A. Gill 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 279 KB

Some Decision Problems Associated with W

Some Decision Problems Associated with Weighted, Directed Graphs

✍ Deuel, D. R.; Gill, A. 📂 Article 📅 1966 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 790 KB

On the k Shortest Simple Paths Problem i

On the k Shortest Simple Paths Problem in Weighted Directed Graphs

✍ Roditty, Liam 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 231 KB

Computer generation of characteristic po

Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs

✍ K. Balasubramanian 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s

Improved processor bounds for parallel a

Improved processor bounds for parallel algorithms for weighted directed graphs

✍ Nancy Amato 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 648 KB