Pages that link to "Item:Q2398207"
From MaRDI portal
The following pages link to Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207):
Displaying 8 items.
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks (Q5055404) (← links)
- (Q5214815) (← links)
- Isomorphism Testing for Graphs Excluding Small Minors (Q5885601) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Canonization of a random circulant graph by counting walks (Q6575405) (← links)
- Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)
