Pages that link to "Item:Q4601884"

The following pages link to Canonizing Graphs of Bounded Tree Width in Logspace (Q4601884):

Displaying 11 items.

• On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
• A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
• A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
• (Q4553282) (← links)
• Canonizing Graphs of Bounded Tree Width in Logspace (Q4973889) (← links)
• An improved isomorphism test for bounded-tree-width graphs (Q5002745) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Graph isomorphism restricted by lists (Q5918143) (← links)