Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint) - Tapa blanda

Cai, Jiazhen

 
9781333432713: Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Sinopsis

Explore how planar graph embeddings are counted using DFS trees and structured maps. This book explains methods to count and generate embeddings of planar graphs, using DFS representations and careful partitioning of edges.

It covers how to move from biconnected graphs to general graphs, and from planar maps to reduced partitions. The approach combines planarity testing with counting techniques to count embeddings and to generate them efficiently.


  • How DFS representations are used to analyze tree and back edges in planar graphs

  • Techniques for counting embeddings of biconnected graphs and extending to general graphs

  • Concepts like planar maps, reduced maps, and reduced partitions for counting

  • Methods to generate a single embedding or all embeddings in time linear to input and output



Ideal for readers of graph theory and algorithms who want a rigorous, constructive treatment of planar embeddings and their counts.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Excerpt from Counting Embeddings of Planar Graphs Using Dfs Trees

Observation 1. Let C be a simple closed curve on the plane as in Fig. 2; let a be a point inside C and b be a point outside C. Then any curve that joins a and b will cross C.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9780428418342: Counting Embeddings of Planar Graphs Using Dfs Trees (Classic Reprint)

Edición Destacada

ISBN 10:  0428418341 ISBN 13:  9780428418342
Editorial: Forgotten Books, 2018
Tapa dura