Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs (Q2445238): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2013.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W1964464279
@@ Property / OpenAlex ID: W1964464279 / rank @@
+Normal rank
@@ Property / cites work @@
+Data communications, computer networks, and open systems.
+Normal rank
@@ Property / cites work @@
+Computing 2-terminal reliability for radio-broadcast networks
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for computing the reliability of permutation and interval graphs
+Normal rank
@@ Property / cites work @@
+On powers of \(m\)-trapezoid graphs
@@ Property / cites work: On powers of \(m\)-trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in on d-Trapezoid Graphs
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2445238