Finding Densest Subgraphs with Edge-Color Constraints
<|reference_start|>Finding Densest Subgraphs with Edge-Color Constraints: We consider a variant of the densest subgraph problem in networks with single or multiple edge attributes. For example, in a social network, the edge attributes may describe the type of relationship between users, such as friends, family, or acquaintances, or different types of communication. For conceptual simplicity, we view the attributes as edge colors. The new problem we address is to find a diverse densest subgraph that fulfills given requirements on the numbers of edges of specific colors. When searching for a dense social network community, our problem will enforce the requirement that the community is diverse according to criteria specified by the edge attributes. We show that the decision versions for finding exactly, at most, and at least $\textbf{h}$ colored edges densest subgraph, where $\textbf{h}$ is a vector of color requirements, are NP-complete, for already two colors. For the problem of finding a densest subgraph with at least $\textbf{h}$ colored edges, we provide a linear-time constant-factor approximation algorithm when the input graph is sparse. On the way, we introduce the related at least $h$ (non-colored) edges densest subgraph problem, show its hardness, and also provide a linear-time constant-factor approximation. In our experiments, we demonstrate the efficacy and efficiency of our new algorithms.<|reference_end|>
@article{oettershagen2024finding,
    title={Finding Densest Subgraphs with Edge-Color Constraints},
    author={Lutz Oettershagen and Honglian Wang and Aristides Gionis},
    journal={arXiv preprint arXiv:2402.09124},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.09124},
    primaryClass={cs.SI}
}