The complexity of broadcasting in planar and decomposable graphs (Q1392535): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Broadcasting in Bounded Degree Graphs
@@ Property / cites work: Broadcasting in Bounded Degree Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036592
@@ Property / cites work: Q4036592 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of gossiping and broadcasting in communication networks
+Normal rank
@@ Property / cites work @@
+The decomposition of graphs into \(k\)-connected components
+Normal rank
@@ Property / cites work @@
+Q3359735
@@ Property / cites work: Q3359735 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of broadcasting in planar and decomposable graphs
+Normal rank
@@ Property / cites work @@
+Broadcast Networks of Bounded Degree
@@ Property / cites work: Broadcast Networks of Bounded Degree / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Information Dissemination in Trees
@@ Property / cites work: Information Dissemination in Trees / rank @@
+Normal rank