WorldCat Linked Data Explorer

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

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

Planar Graphs Theory and Algorithms. North-Holland Mathematics Studies, Volume 140: Annals of Discrete Mathematics, Volume 32

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- o.

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- o."@en
  • "Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included."
  • "Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included."@en

genre

http://schema.org/genre

  • "Llibres electrònics"
  • "Electronic resource"@en
  • "Electronic books"
  • "Electronic books"@en

name

http://schema.org/name

  • "Planar Graphs Theory and Algorithms. North-Holland Mathematics Studies, Volume 140: Annals of Discrete Mathematics, Volume 32"@en
  • "Planar graphs theory and algorithms"@en
  • "Planar graphs theory and algorithms"
  • "Planar Graphs Theory and Algorithms"@en
  • "Planar graphs : Theory and algorithms"
  • "Planar graphs: theory and algorithms"
  • "Planar graphs : theory and algorithms"@en
  • "Planar graphs : theory and algorithms"
  • "Planar graphs: theory and algoritms"

workExample