Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations
Optimal graph embeddings represent graphs in a lower dimensional space in a way that preserves the structure and properties of the original graph. These techniques have wide applications in fields such as machine learning, data mining, and network analysis. Do we have small (if possible minimal) k-c...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2023/3919389 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|