Pages that link to "Item:Q5898822"
From MaRDI portal
The following pages link to Logical Approaches to Computational Barriers (Q5898822):
Displaying 16 items.
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- The graph isomorphism problem on geometric graphs (Q2928583) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- (Q4016724) (← links)
- (Q4882473) (← links)
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs (Q5415474) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)