Add to ORKGAbstract. We show that isomorphism testing of k-trees is in the class StUSPACE(log n) (strongly unambiguous logspace). This bound follows from a deterministic logspace algorithm that accesses a strongly unambiguous logspace oracle for canonizing k-trees. Further we give a logspace canonization algorithm for k-paths.
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
The time, space, and data complexity of an optimally data efficient isomorphism identification algor...
AbstractWe show that, for k constant, k-tree isomorphism can be decided in logarithmic space by givi...
We show that, for k constant, k -tree isomorphism can be decided in logarithmic space by giving a...
Several new tree problems are shown complete for deterministic logarithmic space. These include the ...
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphis...
We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded...
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance wid...
We give a new fpt algorithm testing isomorphism of n-vertex graphs of tree width k in time 2^{k poly...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in ...
Abstract. Using logspace counting classes we study the computational complexity of hypergraph and gr...
The graph isomorphism problem GI consists of deciding whether there is a bijection between the verti...
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
The time, space, and data complexity of an optimally data efficient isomorphism identification algor...
AbstractWe show that, for k constant, k-tree isomorphism can be decided in logarithmic space by givi...
We show that, for k constant, k -tree isomorphism can be decided in logarithmic space by giving a...
Several new tree problems are shown complete for deterministic logarithmic space. These include the ...
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphis...
We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded...
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance wid...
We give a new fpt algorithm testing isomorphism of n-vertex graphs of tree width k in time 2^{k poly...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in ...
Abstract. Using logspace counting classes we study the computational complexity of hypergraph and gr...
The graph isomorphism problem GI consists of deciding whether there is a bijection between the verti...
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
The time, space, and data complexity of an optimally data efficient isomorphism identification algor...