The following pages link to (Q3912033):
Displaying 12 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
