Pages that link to "Item:Q5338788"
From MaRDI portal
The following pages link to Maxima for Graphs and a New Proof of a Theorem of Turán (Q5338788):
Displayed 13 items.
- Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
- Cliques and the spectral radius (Q2642018) (← links)
- Image Segmentation by Dominant Sets (Q3438915) (← links)
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- The maximum clique and the signless Laplacian eigenvalues (Q3624950) (← links)
- Algorithmic Solution of Extremal Digraph Problems (Q3745867) (← links)
- Inequalities in probability theory and turán-type problems for graphs with colored vertices (Q3970903) (← links)
- A global optimization approach for solving the maximum clique problem (Q4009762) (← links)
- Optimisation of quadratic forms associated with graphs (Q4124867) (← links)
- The inducibility of complete bipartite graphs (Q4309990) (← links)
- Neural networks for NP-complete problems (Q4377229) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)