Layout permutation problems and well-partially-ordered sets

Authors:
Michael R. Fellows;Michael A. Langston
Affiliations:
-;-
Venue:
Proceedings of the fifth MIT conference on Advanced research in VLSI
Year:
1988

Citing 0
Cited 3

Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A survey of graph layout problems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract