Finding the Maximal Incidence Matrix of a Large Graph.

Abstract

The paper deals with the computation of two canonical representations of a graph. A computer program is presented which searches for 'the maximal incidence matrix' of a large connected graph without multiple edges or self-loops. The use of appropriate algorithms and data structures is discussed.

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1975
Accession Number
ADA017331

Entities

People

  • Andrzej Proskurowski
  • Michael Overton

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computer Programs
  • Computers
  • Mathematical Analysis
  • Mathematics

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.