A Continuous-Based Approach for Partial Clique Enumeration

DOI10.1007/978-3-540-72903-7_6zbMath1182.68144OpenAlexW2117599739MaRDI QIDQ5325718

Andrea Torsello, Marcello Pelillo, Samuel Rota Bulò

Publication date: 24 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72903-7_6

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ Adaptive trajectory analysis of replicator dynamics for data clustering ⋮ Unnamed Item ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs ⋮ On Lagrangians of \(r\)-uniform hypergraphs ⋮ A continuous characterization of the maximum vertex-weighted clique in hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs