Improved planarity algorithms
Copyright policy )Improved planarity algorithms
Three planarity algorithms PA-1, PA-2, and PA-3 are presented which are substantial improvements upon those of Demoucronet al. and Rubin, respectively. The algorithms test the planarity of a graphG by attempting to embed it into the plane step by step. If such an embedding can succeed,G is determined as planar and its planar representation is acquired simultaneously. Among others, PA-3 has been implemented in ALGOL on UNIVAC-1100. The program takes about 13.5 seconds to test a graph of 1000 vertices and 2994 edges.
heuristic method, Graph theory (including graph drawing) in computer science, automatic generation of IC mask patterns, planar graph, planarization, 22, 2-16 (1982), Software, source code, etc. for problems pertaining to combinatorics, planar representation
heuristic method, Graph theory (including graph drawing) in computer science, automatic generation of IC mask patterns, planar graph, planarization, 22, 2-16 (1982), Software, source code, etc. for problems pertaining to combinatorics, planar representation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!