Pages that link to "Item:Q4899255"
From MaRDI portal
The following pages link to On Tractable Parameterizations of Graph Isomorphism (Q4899255):
Displaying 15 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- On the generic complexity of the searching graph isomorphism problem (Q889990) (← links)
- Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics (Q2195553) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- A note on the connected game coloring number (Q2700603) (← links)
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters (Q3188910) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- (Q5089162) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713880) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
