Counting the number of vertex covers in a trapezoid graph (Q990956): Difference between revisions

@@ Property / cites work @@
+Chaining algorithms for multiple genome comparison
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
+Normal rank
@@ Property / cites work @@
+Q3797233
@@ Property / cites work: Q3797233 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the size of minimal covers
@@ Property / cites work: A note on the size of minimal covers / rank @@
+Normal rank
@@ Property / cites work @@
+Trapezoid graphs and their coloring
@@ Property / cites work: Trapezoid graphs and their coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+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 @@
+Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
+Normal rank
@@ Property / cites work @@
+On efficient fixed-parameter algorithms for weighted vertex cover
+Normal rank
@@ Property / cites work @@
+Counting the number of independent sets in chordal graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the minimum connected domination on trapezoid graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank