Finding the largest triangle in a graph in expected quadratic time.
Giuseppe LanciaPaolo VidoniPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- random walk
- graph representation
- graph theory
- stable set
- neural network
- graph structure
- connected components
- structured data
- weighted graph
- information retrieval
- real time
- pseudo boolean functions
- objective function
- image segmentation
- information systems
- graph theoretic
- graphical representation
- dependency graph
- edge disjoint