scientific article
From MaRDI portal
Publication:3218070
zbMath0554.94021MaRDI QIDQ3218070
Andrzej Proskurowski, Charles J. Colbourn
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear time algorithmconcurrencyseries-parallel networkmaximal number of collision-free transmissions
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items
Seeing Arboretum for the (partial k-) Trees, Complexity of Finding Embeddings in a k-Tree, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Forbidden minors characterization of partial 3-trees, The efficiency of AC graphs, On some optimization problems on \(k\)-trees and partial \(k\)-trees
