2391 search results - page 479 / 479 » From Nature to Methods and Back to Nature |
SODA
2012
ACM
12 years 6 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...