Shannon switching games without terminals. III
type: Item
instance of: scholarly article
title: Shannon switching games without terminals. III
zbMATH Open document ID: 0794.90088
DOI: 10.1007/BF02349966
author: Yōhei Yamasaki
published in: Graphs and Combinatorics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 93445
zbMATH Keywords: Shannon switching games
zbMATH Keywords: matroid
MaRDI profile type: Publication
cites work: Directed switching games on graphs and matroids
cites work: A Solution of the Shannon Switching Game
cites work: Theory of division games
cites work: Shannon switching games without terminals. II
cites work: A difficulty in particular Shannon-like games
Recommended article: Shannon switching games without terminals. II
Recommended article: A Solution of the Shannon Switching Game
Recommended article: Strategies for the Shannon Switching Game
Recommended article: A solution of the misère Shannon switching game
Recommended article: Q3714930
Recommended article: Shannon-like games are difficult
Recommended article: Q5234201
Recommended article: Shannon rate-efficient power allocation games
Recommended article: A difficulty in particular Shannon-like games
Recommended article: Q3772005
description: scientific article; zbMATH DE number 93445