Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2018.03.017
@@ Property / DOI: 10.1016/j.amc.2018.03.017 / rank @@
-Normal rank
@@ 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.amc.2018.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2794749612
@@ Property / OpenAlex ID: W2794749612 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in regular graphs and sum-free subsets of finite groups
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Network entropies based on independent sets and matchings
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Information processing in complex networks: Graph entropy and information functionals
+Normal rank
@@ Property / cites work @@
+Probabilistic inequalities for evaluating structural network measures
+Normal rank
@@ Property / cites work @@
+A history of graph entropy measures
@@ Property / cites work: A history of graph entropy measures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3807048
@@ Property / cites work: Q3807048 / rank @@
+Normal rank
@@ Property / cites work @@
+An Entropy Approach to the Hard-Core Model on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4053473
@@ Property / cites work: Q4053473 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting independent sets in tree convex bipartite graphs
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for counting independent sets in bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs revisited
@@ Property / cites work: Entropy and the complexity of graphs revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Counting the number of independent sets in chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3931424
@@ Property / cites work: Q3931424 / rank @@
+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 @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q5801644
@@ Property / cites work: Q5801644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4840778
@@ Property / cites work: Q4840778 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2758342
@@ Property / cites work: Q2758342 / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima and minima of the Hosoya index and the Merrifield-Simmons index
+Normal rank
@@ Property / cites work @@
+Q5280019
@@ Property / cites work: Q5280019 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q130060574
@@ Property / Wikidata QID: Q130060574 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2018.03.017
@@ Property / DOI: 10.1016/J.AMC.2018.03.017 / rank @@
+Normal rank