𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recognition algorithm for the total graphs

✍ Scribed by F. Gavril

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
581 KB
Volume
8
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident.

In this paper we present a linear time algorithm for the recognition of the total graphs. The algorithm is based on the breadth‐first search technique.

πŸ“œ SIMILAR VOLUMES

A word graph algorithm for large vocabul
A word graph algorithm for large vocabulary continuous speech recognition
✍ Stefan Ortmanns; Hermann Ney; Xavier Aubert πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a

Algorithms for partitioning a graph
Algorithms for partitioning a graph
✍ Taehoon Park; Chae Y. Lee πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 606 KB