How to Build a Graph in n Days: Some Variants on Graph Assembly
Aria Dougherty, Nick Mayers, Robert Short

TL;DR
This paper extends the concept of assembly trees for graphs, providing a more generalized framework for understanding graph construction processes, building on prior work by Bona and Vince.
Contribution
It introduces a broader definition of assembly trees and explores their properties, advancing the theoretical understanding of graph assembly methods.
Findings
Generalized assembly tree definition established
Extended analysis of assembly tree properties
Connections to graph construction processes
Abstract
In a recent article by M. Bona and A. Vince, the authors introduced the concept of an assembly tree for a graph. Assembly trees act as record keeping devices for the construction of a given graph from its vertices. In this paper we extend the work initiated by M. Bona and A. Vince as well as define and examine a more generalized definition of assembly tree.
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
TopicsAlgorithms and Data Compression · Computational Geometry and Mesh Generation · semigroups and automata theory
