Pages that link to "Item:Q1019184"
From MaRDI portal
The following pages link to Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184):
Displaying 7 items.
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Computing graph automorphism from partial solutions (Q2272212) (← links)
- The complexity of modular graph automorphism (Q2706110) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- (Q3517106) (← links)
- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism (Q3525603) (← links)
- (Q4381387) (← links)