Finding conserved low‐diameter subgraphs in social and biological networks
The analysis of social and biological networks often involves modeling clusters of interest as
cliques or their graph‐theoretic generalizations. The kk‐club model, which relaxes the …
cliques or their graph‐theoretic generalizations. The kk‐club model, which relaxes the …
[HTML][HTML] Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
PK Jha - Discrete Applied Mathematics, 2023 - Elsevier
An exchanged hypercube is a spanning subgraph of a hypercube. It retains a large number
of desirable properties of the hypercube, yet maintains a reduced interconnection …
of desirable properties of the hypercube, yet maintains a reduced interconnection …
-fault-tolerant graphs for disjoint complete graphs of order
Vertex-fault-tolerance was introduced by Hayes~\cite {Hayes1976} in 1976, and since then it
has been systematically studied in different aspects. In this paper we study $ k $-vertex-fault …
has been systematically studied in different aspects. In this paper we study $ k $-vertex-fault …
[PDF][PDF] Combinatorial Clustering Engineering in Communications: Preliminary Survey. Preprint. November 6, 2024
MS Levin - 2024 - researchgate.net
The article addresses applications of combinatorial clustering engineering approach in
communication networks including design of layered network architecture, routing …
communication networks including design of layered network architecture, routing …
[PDF][PDF] Combinatorial Clustering Engineering in Communications: Preliminary Survey.
MS Levin - 2024 - iitp.ru
The article addresses applications of combinatorial clustering engineering approach in
communication networks including design of layered network architecture, routing …
communication networks including design of layered network architecture, routing …
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
N Grüttemeier, PH Keßler, C Komusiewicz… - Journal of Combinatorial …, 2024 - Springer
Abstract In the Vertex Triangle 2-Club problem, we are given an undirected graph G and aim
to find a maximum-vertex subgraph of G that has diameter at most 2 and in which every …
to find a maximum-vertex subgraph of G that has diameter at most 2 and in which every …
[PDF][PDF] Partitioning a graph into low-diameter clusters
This paper studies the problems of partitioning the vertices of a graph G=(V, E) into (or
covering with) a minimum number of low-diameter clusters from the lenses of approximation …
covering with) a minimum number of low-diameter clusters from the lenses of approximation …