Optimal Induced Universal Graphs and Adjacency Labeling for Trees


In this article, we show that there exists a graph <i>G</i> with <i>O</i>(<i>n</i>) nodes such that any forest of <i>n</i> nodes is an induced subgraph of <i>G</i>. Furthermore, for constant arboricity <i>k</i>, the result implies the existence of a graph with <i>O</i>(<i>n</i><sup><i>k</i></sup>) nodes that contains all <i>n</i>-node graphs of arboricity… (More)
DOI: 10.1145/3088513


5 Figures and Tables


Citations per Year

Citation Velocity: 15

Averaging 15 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics