๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

โœ Scribed by Mohar, Bojan

Book ID
111947925
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
413 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear time recognition algorithm for
A linear time recognition algorithm for proper interval graphs
โœ B.S. Panda; Sajal K. Das ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian