Add to ORKGEver since Reingold’s deterministic logspace algorithm [66] for undirected graph reachability, logspace algorithms for various combinatorial problems have been discovered and it is now a flourishing area of research. Notable examples include special cases of directed graph reachability and planar graph isomorphism [23]. In this interesting article, Johannes Köbler, Sebastian Kuhnert and Oleg Ver-bitsky discuss the structural properties of interval graphs and other technical ingredients that go into their recent logspace isomorphism algorithm for interval graphs, along with some generalizations and new directions
AbstractWe show that, for k constant, k-tree isomorphism can be decided in logarithmic space by givi...
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{...
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphis...
A graph is an interval graph if and only if each of its vertices can be associated with an interval ...
We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
AbstractThe graph reconstruction conjecture is a long-standing open problem in graph theory. There a...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance wid...
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 ...
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-conn...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
A recent result has shown that the graph isomorphism problem can be solved in quasi-polynomial time,...
AbstractWe show that, for k constant, k-tree isomorphism can be decided in logarithmic space by givi...
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{...
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphis...
A graph is an interval graph if and only if each of its vertices can be associated with an interval ...
We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
AbstractThe graph reconstruction conjecture is a long-standing open problem in graph theory. There a...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance wid...
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 ...
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-conn...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
A recent result has shown that the graph isomorphism problem can be solved in quasi-polynomial time,...
AbstractWe show that, for k constant, k-tree isomorphism can be decided in logarithmic space by givi...
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{...
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphis...