Pages that link to "Item:Q1401960"

The following pages link to Completeness results for graph isomorphism. (Q1401960):

Displaying 14 items.

• The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
• Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
• Reductions to graph isomorphism (Q987394) (← links)
• The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
• Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
• On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
• Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
• Isomorphism of Regular Trees and Words (Q3012921) (← links)
• The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
• On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
• Compressed Tree Canonization (Q3449487) (← links)
• A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
• Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)