Pages that link to "Item:Q1602541"
From MaRDI portal
The following pages link to A genetic algorithm for determining the thickness of a graph (Q1602541):
Displaying 4 items.
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- On the complexity of average path length for biological networks and patterns (Q2922126) (← links)
- Computing strong metric dimension of some special classes of graphs by genetic algorithms (Q3649746) (← links)