An Algorithm for Testing the Planarity of Partially Oriented Graphs.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA048052

Entities

People

  • W. M. Vancleemput

Organizations

  • Stanford University

Tags

Communities of Interest

  • Advanced Electronics
  • Air Platforms
  • C4I
  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Air Force Facilities
  • Algorithms
  • Circuits
  • Computer Science
  • Electrical Engineering
  • Electronics
  • Electronics Laboratories
  • Engineering
  • Graph Theory
  • Military Research
  • New Jersey
  • New Mexico
  • New York
  • Physics Laboratories
  • Universities

Readers

  • Computational Linguistics
  • Integrated Circuit Design and Technology.