11 search results - page 3 / 3 » Efficient polynomial time algorithms computing industrial-st... |
157
click to vote
CPC
2006
15 years 5 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...