Pages that link to "Item:Q3902476"
From MaRDI portal
The following pages link to Some NP-Complete Problems Similar to Graph Isomorphism (Q3902476):
Displaying 33 items.
- On rotational symmetries of drawings of coherent periodic graphs (Q324851) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Quadratic forms and the graph isomorphism problem (Q810529) (← links)
- On the subgroup distance problem. (Q1011736) (← links)
- Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A correction to Colbourn's paper on the complexity of matrix symmetrizability (Q1150268) (← links)
- Le problème d'étoiles pour graphes est NP-complèt (Q1151755) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- On the isomorphism of expressions (Q1583053) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Subcomplete generalizations of graph isomorphism (Q1838044) (← links)
- Drawing series parallel digraphs symmetrically (Q1841117) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Characterizing and computing weight-equitable partitions of graphs (Q2132504) (← links)
- Symmetry detection and classification in drawings of graphs (Q2206881) (← links)
- Computing graph automorphism from partial solutions (Q2272212) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Geometric automorphism groups of graphs (Q2457002) (← links)
- Exploring symmetries to decompose matrices and graphs preserving the spectrum (Q2797102) (← links)
- On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
- Circulant graphs: efficient recognizing and isomorphism testing (Q3439301) (← links)
- Reconstructing a Graph from its Neighborhood Lists (Q4290082) (← links)
- Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
