An Algorithm for Testing the Planarity of Partially Oriented Graphs.
STANFORD UNIV CALIF DIGITAL SYSTEMS LAB
Pagination or Media Count:
An efficient algorithm will be presented for testing the planarity of oriented and partially oriented graphs. This algorithm is very useful for solving problems related to the circuit layout problem. Author
- Electrical and Electronic Equipment
- Theoretical Mathematics