Pages that link to "Item:Q3613744"

The following pages link to Testing Graph Isomorphism in Parallel by Playing a Game (Q3613744):

Displaying 11 items.

• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
• Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
• The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
• Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
• A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
• From Invariants to Canonization in Parallel (Q3503640) (← links)
• Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
• (Q4553282) (← links)
• The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 (Q5215472) (← links)
• The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
• Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)