Pages that link to "Item:Q2272212"
From MaRDI portal
The following pages link to Computing graph automorphism from partial solutions (Q2272212):
Displaying 8 items.
- A note on decision versus search for graph automorphism (Q675067) (← links)
- Automatic proof of graph nonisomorphism (Q841683) (← links)
- Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184) (← links)
- Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (Q1597764) (← links)
- The complexity of modular graph automorphism (Q2706110) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism (Q3525603) (← links)
- (Q4381387) (← links)