Maximizing edge connectivity in graph partitioning using hotspots
Graphs have long been used to model relationships between entities. For some applications, a single graph is sufficient; for other problems, a collection of graphs may be more appropriate to represent the underlying data. Many contemporary problem domains, for which graphs are an ideal data mod...
Saved in:
| Main Authors: | Isam A. Alobaidi, Hiba G. Fareed, Jennifer L. Leopold, Andrea E. Smit |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2025-01-01
|
| Series: | International Journal of Data and Network Science |
| Online Access: | https://www.growingscience.com/ijds/Vol9/ijdns_2025_8.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
by: Michael R. Yatauro
Published: (2025-01-01) -
On the maximal Aa
-index of graphs with a prescribed number of edges
by: Chang Ting-Chung, et al.
Published: (2025-05-01) -
Edge connectivity of a neutrosophic graph
by: Aparna Tripathy, et al.
Published: (2025-04-01) -
Characterizing the forbidden pairs for graphs to be super-edge-connected
by: Hazhe Ye, et al.
Published: (2025-05-01) -
On the existence of tripartite graphs and n-partite graphs
by: Guo Jiyun, et al.
Published: (2024-12-01)