Maximising the number of regions when embedding a N-cycle graph
Adam Dunajski
TL;DR
This paper determines the maximum number of regions formed by embedding an N-cycle graph with straight lines, providing insights into geometric graph embeddings.
Contribution
It introduces a method to calculate the maximum regions created by straight-line embeddings of N-cycle graphs, a novel geometric graph analysis.
Findings
Derived a formula for maximum regions for N-cycle embeddings
Identified optimal embedding configurations
Enhanced understanding of geometric graph partitioning
Abstract
We find the maximal number of regions that a straight line embedding of a N-cycle graph can enclose.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Algorithms and Data Compression · Interconnection Networks and Systems