[HTML][HTML] A note on the satisfactory partition problem: Constant size requirement
F Ciccarelli, M Di Ianni, G Palumbo - Information Processing Letters, 2023 - Elsevier
A satisfactory partition is a partition of the vertex set V of a graph into two subsets such that
each vertex has at least as many neighbors in the subset it belongs to as in the other subset …
each vertex has at least as many neighbors in the subset it belongs to as in the other subset …
Proportionally dense subgraphs of maximum size in degree-constrained graphs
N Baghirova, A Castillon - arXiv preprint arXiv:2405.20847, 2024 - arxiv.org
A proportionally dense subgraph (PDS) of a graph is an induced subgraph of size at least
two such that every vertex in the subgraph has proportionally as many neighbors inside as …
two such that every vertex in the subgraph has proportionally as many neighbors inside as …
[PDF][PDF] On finding a satisfactory partition in an undirected graph: algorithm design and results
S Nofal - AIMS Mathematics, 2024 - aimspress.com
A satisfactory partition is a partition of undirected-graph vertices such that the partition has
only two nonempty parts, and every vertex has at least as many adjacent vertices in its part …
only two nonempty parts, and every vertex has at least as many adjacent vertices in its part …
[HTML][HTML] Finding k-community structures in special graph classes
For an integer k≥ 2, a k-community structure in an undirected graph is a partition of its
vertex set into k sets called communities, each of size at least two, such that every vertex of …
vertex set into k sets called communities, each of size at least two, such that every vertex of …
Alliances in Graphs: A Parameterized Perspective
SK Tripathi - 2022 - dr.iiserpune.ac.in
Throughout history, humans have formed communities, guilds, faiths etc in the hope of
coming together with a group of people having similar requirements, visions and goals …
coming together with a group of people having similar requirements, visions and goals …