Log-space algorithms for paths and matchings in \(k\)-trees (Q385514): 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.1007/s00224-013-9469-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2037858972
@@ Property / OpenAlex ID: W2037858972 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar and grid graph reachability problems
@@ Property / cites work: Planar and grid graph reachability problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Space Complexity of k-Tree Isomorphism
@@ Property / cites work: The Space Complexity of k-Tree Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Algebraic Formulas Using a Constant Number of Registers
+Normal rank
@@ Property / cites work @@
+Q3219133
@@ Property / cites work: Q3219133 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Parallel Algorithm for Formula Evaluation
+Normal rank
@@ Property / cites work @@
+Division in logspace-uniform<i>NC</i><sup>1</sup>
@@ Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic simplicial complexes
@@ Property / cites work: On acyclic simplicial complexes / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity, Determinants, Permanents, and (Unique) Matchings
+Normal rank
@@ Property / cites work @@
+Deterministically isolating a perfect matching in bipartite planar graphs
+Normal rank
@@ Property / cites work @@
+Counting quantifiers, successor relations, and logarithmic space
+Normal rank
@@ Property / cites work @@
+On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
+Normal rank
@@ Property / cites work @@
+Fast parallel reordering and isomorphism testing of \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Embeddings of \(k\)-connected graphs of pathwidth \(k\)
+Normal rank
@@ Property / cites work @@
+Uniform constant-depth threshold circuits for division and iterated multiplication.
+Normal rank
@@ Property / cites work @@
+On the Bipartite Unique Perfect Matching Problem
@@ Property / cites work: On the Bipartite Unique Perfect Matching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
+Normal rank
@@ Property / cites work @@
+Constructing a perfect matching is in random NC
@@ Property / cites work: Constructing a perfect matching is in random NC / rank @@
+Normal rank
@@ Property / cites work @@
+The Isomorphism Problem for k-Trees Is Complete for Logspace
+Normal rank
@@ Property / cites work @@
+Q5414582
@@ Property / cites work: Q5414582 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+Bounded Tree-Width and LOGCFL
@@ Property / cites work: Bounded Tree-Width and LOGCFL / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:385514