Pages that link to "Item:Q360469"
From MaRDI portal
The following pages link to An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469):
Displaying 6 items.
- Sharp lower bounds on the Narumi-Katayama index of graph operations (Q274395) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
