AbstractIt is shown that homotopy equivalence of finite topological spaces is polynomially equivalent to testing graph isomorphism
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
Our main result states that for each finite complex L the category TOP of topological spaces possess...
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
AbstractIt is shown that homotopy equivalence of finite topological spaces is polynomially equivalen...
AbstractOn one hand the graph isomorphism problem (GI) has received considerable attention due to it...
AbstractOn one hand the graph isomorphism problem (GI) has received considerable attention due to it...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
We compare the capabilities of two approaches to approximating graph isomorphism using linear algebr...
AbstractA construction is described to encode an arbitrary graph uniquely as a block design. This de...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
We show that the homotopy category of unpointed spaces admits no set of objects jointly reflecting i...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
Our main result states that for each finite complex L the category TOP of topological spaces possess...
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
AbstractIt is shown that homotopy equivalence of finite topological spaces is polynomially equivalen...
AbstractOn one hand the graph isomorphism problem (GI) has received considerable attention due to it...
AbstractOn one hand the graph isomorphism problem (GI) has received considerable attention due to it...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
We compare the capabilities of two approaches to approximating graph isomorphism using linear algebr...
AbstractA construction is described to encode an arbitrary graph uniquely as a block design. This de...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
We show that the homotopy category of unpointed spaces admits no set of objects jointly reflecting i...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
Our main result states that for each finite complex L the category TOP of topological spaces possess...
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
DOI
Add to ORKG