Pages that link to "Item:Q2849306"
From MaRDI portal
The following pages link to Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306):
Displaying 10 items.
- Relational linear programming (Q511779) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (Q4635847) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- Isomorphism Test for Digraphs with Weighted Edges. (Q5140741) (← links)
- Approximate lumpability for Markovian agent-based models using local symmetries (Q5235047) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)