Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749): Difference between revisions

@@ Property / author @@
-Joost Engelfriet
@@ Property / author: Joost Engelfriet / rank @@
-Normal rank
@@ Property / author @@
-Tero J.Harju
@@ Property / author: Tero J.Harju / rank @@
-Normal rank
@@ Property / author @@
+Joost Engelfriet
@@ Property / author: Joost Engelfriet / rank @@
+Normal rank
@@ Property / author @@
+Tero J.Harju
@@ Property / author: Tero J.Harju / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Forbidden minors characterization of partial 3-trees
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+Normal rank
@@ Property / cites work @@
+Modules of Coherent Binary Systems
@@ Property / cites work: Modules of Coherent Binary Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Primitive 2-structures with the \((n-2)\)-property
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for the Decomposition of Graphs and Posets
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental construction of 2-structures
@@ Property / cites work: Incremental construction of 2-structures / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of 2-structures. I: Clans, basic subclasses, and morphisms
+Normal rank
@@ Property / cites work @@
+Theory of 2-structures. II: Representation through labeled tree families
+Normal rank
@@ Property / cites work @@
+Primitivity is hereditary for 2-structures
@@ Property / cites work: Primitivity is hereditary for 2-structures / rank @@
+Normal rank
@@ Property / cites work @@
+Angular 2-structures
@@ Property / cites work: Angular 2-structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037316
@@ Property / cites work: Q4037316 / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179852
@@ Property / cites work: Q4179852 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q4296302
@@ Property / cites work: Q4296302 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q3865813
@@ Property / cites work: Q3865813 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3732972
@@ Property / cites work: Q3732972 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789084
@@ Property / cites work: Q3789084 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of graph languages generated by hyperedge replacement
+Normal rank
@@ Property / cites work @@
+Q4037325
@@ Property / cites work: Q4037325 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding tournaments in simple tournaments
@@ Property / cites work: Embedding tournaments in simple tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental modular decomposition
@@ Property / cites work: Incremental modular decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Either tournaments or algebras?
@@ Property / cites work: Either tournaments or algebras? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3198869
@@ Property / cites work: Q3198869 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Tree-size bounded alternation
@@ Property / cites work: Tree-size bounded alternation / rank @@
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
+Normal rank
@@ Property / cites work @@
+Q3670598
@@ Property / cites work: Q3670598 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Graphs indecomposable with respect to the X-join
@@ Property / cites work: Graphs indecomposable with respect to the X-join / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized finite automata theory with an application to a decision problem of second-order logic
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank