Graph-Theoretic Concepts in Computer Science
There are a lot of algorithmic problems which can be solved in polynomial time on permutation graphs.
March 1993
publish date
Paperback
physical format
350
pages
Publisher
Springer
External links
Librarything
https://www.librarything.com/work/1049946Related works
