Open AccessThe Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization
Author(s) -
Aritra Konar,
Nicholas D. Sidiropoulos
Publication year - 2022
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v36i4.20325
Subject(s) - submodular set function , automatic summarization , generalization , extension (predicate logic) , induced subgraph isomorphism problem , relaxation (psychology) , combinatorics , mathematics , computer science , regular polygon , approximation algorithm , function (biology) , discrete mathematics , algorithm , graph , artificial intelligence , geometry , biology , psychology , mathematical analysis , social psychology , voltage graph , line graph , evolutionary biology , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom