✦ 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
DOI: 10.1016/0166-218x(84)90067-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm to recognize loca

An efficient algorithm to recognize locally equivalent graphs

✍ André Bouchet 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 723 KB

A fast parallel algorithm to recognize p

A fast parallel algorithm to recognize partitionable graphs

✍ R. Lin; S. Olariu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 402 KB

A linear time algorithm to recognize cir

A linear time algorithm to recognize circular permutation graphs

✍ 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

A linear time and space algorithm to rec

A linear time and space algorithm to recognize interval orders

✍ Philippe Baldy; Michel Morvan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 372 KB

An algorithm to convert graphs into EDNF

✍ Ali A. Khan; Mansoor Al-A'ali; Nigat R. Alam 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 465 KB

An algorithm to find two distance domina

An algorithm to find two distance domination parameters in a graph

✍ Gerd H. Fricke; Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 467 KB