✦ LIBER ✦

On optimal cycle bases of graphs for mesh analysis of networks

✍ Scribed by A. Kaveh

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 334 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On cycle bases of a graph

✍ M. M. Sysło 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

Optimizing Patching-based multicast for

Optimizing Patching-based multicast for video-on-demand in wireless mesh networks

✍ Fei Xie; Kien A. Hua; Ning Jiang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

## Abstract In this work, we study the application of video‐on‐demand (VoD) in wireless mesh networks (WMN), a next generation edge technology to provide broadband data access in residential, business and even city‐wise networks. We adopt a Patching‐based multicast technique to better utilize the b

Subminimal cycle bases for the force met

Subminimal cycle bases for the force method of structural analysis

✍ Kaveh, A. 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 204 KB 👁 1 views

Optimal Ear Decompositions of Matching C

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A Petersen brick is a graph whose underlying simple graph is isomorphic to the Petersen graph. For a matching covered graph G, b(G) denotes the number of bricks of G, and p(G) denotes the number of Petersen bricks of G. An ear decomposition of G is optimal if, among all ear decompositions of G, it u

Optimal design of diagnosable systems on

Optimal design of diagnosable systems on networks constructed by graph operations

✍ Toru Araki; Yukio Shibata 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

Subminimal cycle basis of a graph for ef

Subminimal cycle basis of a graph for efficient force method of frame analysis

✍ Kaveh, A. ;Moez, H. 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

A new method is presented for the formation of subminimal cycle bases of graphs corresponding to sparse exibility matrices. In this approach, a contraction method is used, leading to the reduction of the size of the graph at each step. This reduction facilitates the selection of the smallest cycle a