Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199): Difference between revisions

@@ Property / arXiv ID @@
+.7184
@@ Property / arXiv ID: 1207.7184 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999861
@@ Property / cites work: Q3999861 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3741005
@@ Property / cites work: Q3741005 / rank @@
+Normal rank
@@ Property / cites work @@
+{log}: A language for programming in logic with finite sets
+Normal rank
@@ Property / cites work @@
+Computational Logic and Set Theory
@@ Property / cites work: Computational Logic and Set Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4189277
@@ Property / cites work: Q4189277 / rank @@
+Normal rank
@@ Property / cites work @@
+Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
+Normal rank
@@ Property / cites work @@
+Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
+Normal rank
@@ Property / cites work @@
+Q3992552
@@ Property / cites work: Q3992552 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for computing bisimulation equivalence
+Normal rank
@@ Property / cites work @@
+Well-quasi-ordering hereditarily finite sets
@@ Property / cites work: Well-quasi-ordering hereditarily finite sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385545
@@ Property / cites work: Q4385545 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002403
@@ Property / cites work: Q3002403 / rank @@
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717366
@@ Property / cites work: Q4717366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximately Counting Hamilton Paths and Cycles in Dense Graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
+Normal rank
@@ Property / cites work @@
+Q3565861
@@ Property / cites work: Q3565861 / rank @@
+Normal rank
@@ Property / cites work @@
+Open neighborhood locating-dominating in trees
@@ Property / cites work: Open neighborhood locating-dominating in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs
@@ Property / cites work: Discriminating codes in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in (bipartite) planar graphs
@@ Property / cites work: Discriminating codes in (bipartite) planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subsets
@@ Property / cites work: Induced subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+Set graphs. IV. Further connections with claw-freeness
+Normal rank