The complexity of broadcasting in planar and decomposable graphs
type: Item
instance of: scholarly article
title: The complexity of broadcasting in planar and decomposable graphs
zbMATH Open document ID: 0901.68086
DOI: 10.1016/S0166-218X(97)00110-8
author: Andreas Jakoby
author: Christian Schindelhauer
author: Rüdiger Reischuk
published in: Discrete Applied Mathematics
publication date: 1998-12-02T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 1180308
zbMATH Keywords: broadcasting
zbMATH Keywords: processor networks
MaRDI profile type: Publication
cites work: Easy problems for tree-decomposable graphs
cites work: Broadcasting in Bounded Degree Graphs
cites work: Q4036592
cites work: Planar 3DM is NP-complete
cites work: Q4198056
cites work: A survey of gossiping and broadcasting in communication networks
cites work: The decomposition of graphs into \(k\)-connected components
cites work: Q3359735
cites work: Broadcast Networks of Bounded Degree
cites work: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Information Dissemination in Trees
Wikidata QID: Q126464446
Recommended article: The complexity of broadcasting in planar and decomposable graphs
Recommended article: Q3842539
Recommended article: Broadcasting on recursively decomposable Cayley graphs
Recommended article: On the complexity of the shortest-path broadcast problem
Recommended article: Broadcasting in Bounded Degree Graphs
Recommended article: Q4694740
Recommended article: Q5883640
Recommended article: On the complexity of broadcast domination and multipacking In digraphs
Recommended article: Q3452037
Recommended article: A broadcasting algorithm on the arrangement graph
description: scientific article; zbMATH DE number 1180308