The following pages link to (Q4450785):
Displaying 5 items.
- Matching graphs with unique node labels (Q851709) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- On the maximum density of graphs with unique-path labelings (Q2870502) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)