WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/27974383

Two linear-time algorithms for five-coloring a planar graph

A sequential processing algorithm using bicolor interchange that five-colors an n vertex planar graph in O(n-squared) time was given by Matula, Marble, and Isaacson. Lipton and Miller used a batch processing algorithm with bicolor interchange for the same problem and achieved an improved O(n log n) time bound. In this paper we use graph contraction arguments instead of bicolor interchange and improve both the sequential processing and batch processing methods to obtain five-coloring algorithms that operate in O(n) time. (Author).

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "A sequential processing algorithm using bicolor interchange that five-colors an n vertex planar graph in O(n-squared) time was given by Matula, Marble, and Isaacson. Lipton and Miller used a batch processing algorithm with bicolor interchange for the same problem and achieved an improved O(n log n) time bound. In this paper we use graph contraction arguments instead of bicolor interchange and improve both the sequential processing and batch processing methods to obtain five-coloring algorithms that operate in O(n) time. (Author)."@en

name

http://schema.org/name

  • "Two linear-time algorithms for five-coloring a planar graph"@en
  • "Two linear-time algorithms for five-coloring a planar graph"
  • "Two Linear-Time Algorithms for Five-Coloring a Planar Graph"@en
  • "Two Linear-Time Algorithms for Five-Coloring A Planar Graph"

workExample