𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm to recognize a middle graph

✍ Scribed by Mirosława Skowrońska; Maciej M. Sysło


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
461 KB
Volume
7
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A linear time algorithm to recognize cir
✍ Sritharan, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea