On the Planarity of Hypergraphs.

Abstract

Two definitions for the planarity of a hypergraph will be given. These definitions are related to the problem of modelling circuits for circuit layout. It is shown that if a hypergraph is planar according to the first definition, then it is planar according to the second definition, but the reverse does not hold. Testing the planarity can be done in linear time by using the first definition but requires an enumeration using the second definition. The more accurate model for the circuit layout problem uses the second definition. (Author)

Open PDF

Document Details

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

Entities

People

  • W. M. Vancleemput

Organizations

  • Stanford University

Tags

Communities of Interest

  • Advanced Electronics
  • Air Platforms
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Computer Science
  • Contracts
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Graph Theory
  • Materials
  • Materials Science
  • Military Research
  • New Jersey
  • New Mexico
  • New York
  • Schools
  • United States
  • Universities

Readers

  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.