2012
DOI: 10.48550/arxiv.1210.7985
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Threat, support and dead edges in the Shannon game

Abstract: The notions of captured/lost vertices and dead edges in the Shannon game (Shannon switching game on nodes) are examined using graph theory. Simple methods are presented for identifying some dead edges and some captured sets of vertices, thus simplifying the (computationally hard) problem of analyzing the game.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…The notation follows that of [4]. The Shannon game (G, s, t) is played on a simple graph G (no self-loops, no multiple edges) with two vertices s, t designated as terminals.…”
Section: Definitions; Notationmentioning
confidence: 99%
See 4 more Smart Citations
“…The notation follows that of [4]. The Shannon game (G, s, t) is played on a simple graph G (no self-loops, no multiple edges) with two vertices s, t designated as terminals.…”
Section: Definitions; Notationmentioning
confidence: 99%
“…We will make use of several results from 'Threat, support and dead edges in the Shannon game' [4]. The notation 'theorem TSD.n' refers to theorem n from that paper.…”
Section: Definitions; Notationmentioning
confidence: 99%
See 3 more Smart Citations