Approximately counting locally-optimal structures (Q295655): 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.jcss.2016.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2149592811
@@ Property / OpenAlex ID: W2149592811 / rank @@
+Normal rank
@@ Property / cites work @@
+GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
@@ Property / cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+Tree decompositions with small cost
@@ Property / cites work: Tree decompositions with small cost / rank @@
+Normal rank
@@ Property / cites work @@
+On exact algorithms for treewidth
@@ Property / cites work: On exact algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The graph formulation of the union-closed sets conjecture
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+Treewidth computation and extremal combinatorics
@@ Property / cites work: Treewidth computation and extremal combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+A revisit of the scheme for computing treewidth and minimum fill-in
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Listing Combinatorial Structures
+Normal rank
@@ Property / cites work @@
+Approximately Counting Locally-Optimal Structures
@@ Property / cites work: Approximately Counting Locally-Optimal Structures / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Ferromagnetic Ising with Local Fields
+Normal rank
@@ Property / cites work @@
+Approximating the Partition Function of the Ferromagnetic Potts Model
+Normal rank
@@ Property / cites work @@
+The Complexity of Approximately Counting Tree Homomorphisms
+Normal rank
@@ Property / cites work @@
+Minimal Triangulation Algorithms for Perfect Phylogeny Problems
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
+Normal rank
@@ Property / cites work @@
+Dominating Set Counting in Graph Classes
@@ Property / cites work: Dominating Set Counting in Graph Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Listing all Minimal Separators of a Graph
@@ Property / cites work: Listing all Minimal Separators of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of computing treelength
@@ Property / cites work: On the complexity of computing treelength / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of all minimal separators in a graph
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+Planar Graphs
@@ Property / cites work: Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Unapproximable Versions of $NP$-Complete Problems
+Normal rank