Results 221 to 230 of about 615,797 (257)
Quadratic Subproduct Systems, Free Products, and Their C*-Algebras. [PDF]
Integr Equ Oper TheoryArici F, Ge Y.
europepmc +1 more source
A Dim Space Target Detection and Track Association Method for Dense Stellar Backgrounds. [PDF]
Sensors (Basel)Jiang C, Yang Z, Ma Z, Tong C, Wang J.
europepmc +1 more source
Graph Isomorphism is in SPP [PDF]
Information and Computation, 2006 We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, in ModkP for each k⩾2). These inclusions for Graph Isomorphism were not known prior to membership in SPP.
Vikraman Arvind
exaly +7 more sources
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]
Discrete Applied Mathematics, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Ryuhei Uehara
exaly +2 more sources
Fractional isomorphism of graphs
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ed Scheinerman
exaly +3 more sources
Improved random graph isomorphism [PDF]
Journal of Discrete Algorithms, 2008 Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem.
Gopal Pandurangan
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1997
The \(P_3\)-graph of a finite simple graph \(G\), denoted \(P_3(G)\), is the graph whose vertices are the 3-vertex paths of \(G\), with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. Note that \(P_k(G)\) can be defined in a similar way, and that these graphs generalize \(P_2(G)\), the line graph of \(G\).
Robert E. L. Aldred +3 more
openaire +3 more sources
The \(P_3\)-graph of a finite simple graph \(G\), denoted \(P_3(G)\), is the graph whose vertices are the 3-vertex paths of \(G\), with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. Note that \(P_k(G)\) can be defined in a similar way, and that these graphs generalize \(P_2(G)\), the line graph of \(G\).
Robert E. L. Aldred +3 more
openaire +3 more sources
Journal of Graph Theory, 1977
AbstractThe graph isomorphism problem—to devise a good algorithm for determining if two graphs are isomorphic—is of considerable practical importance, and is also of theoretical interest due to its relationship to the concept of NP‐completeness. No efficient (i.e., polynomial‐bound) algorithm for graph isomorphism is known, and it has been conjectured ...
Ronald C. Read, Derek G. Corneil
openaire +1 more source
AbstractThe graph isomorphism problem—to devise a good algorithm for determining if two graphs are isomorphic—is of considerable practical importance, and is also of theoretical interest due to its relationship to the concept of NP‐completeness. No efficient (i.e., polynomial‐bound) algorithm for graph isomorphism is known, and it has been conjectured ...
Ronald C. Read, Derek G. Corneil
openaire +1 more source
Communications of the ACM, 2020
Exploring the theoretical and practical aspects of the graph isomorphism problem.
Martin Grohe, Pascal Schweitzer
openaire +2 more sources
Exploring the theoretical and practical aspects of the graph isomorphism problem.
Martin Grohe, Pascal Schweitzer
openaire +2 more sources
On the hardness of graph isomorphism
Proceedings 41st Annual Symposium on Foundations of Computer Science, 2002Summary: We show that the graph isomorphism problem is hard under DLOGTIME uniform AC{\(^0\)} many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every logarithmic space modular class {Mod}\(_k\)L and for the class DET of problems NC{\(^1\)} reducible to the determinant.
openaire +1 more source