Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914): Difference between revisions

@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Fast and simple algorithms to count the number of vertex covers in an interval graph
+Normal rank
@@ Property / cites work @@
+Counting the number of independent sets in chordal graphs
+Normal rank
@@ Property / cites work @@
+Counting independent sets in tree convex bipartite graphs
+Normal rank
@@ Property / cites work @@
+Counting independent sets in a tolerance graph
@@ Property / cites work: Counting independent sets in a tolerance graph / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge domination on bipartite permutation graphs and cotriangulated graphs
+Normal rank
@@ Property / cites work @@
+Solving the weighted efficient edge domination problem on bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+Q5463359
@@ Property / cites work: Q5463359 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear structure of bipartite permutation graphs and the longest path problem
+Normal rank
@@ Property / cites work @@
+Bandwidth of bipartite permutation graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Visibility graphs of towers
@@ Property / cites work: Visibility graphs of towers / rank @@
+Normal rank