✦ LIBER ✦

Subgraph isomorphism for biconnected outerplanar graphs in cubic time

✍ Scribed by Andrzej Lingas

Book ID: 107948615
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 858 KB
Volume: 63
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90011-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The subgraph isomorphism problem for out

The subgraph isomorphism problem for outerplanar graphs

✍ Maciej M. SysŁ;o 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 702 KB

A SimpleO(log N) Time Parallel Algo

A SimpleO(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

✍ Srabani Sen Gupta; Bhabani P. Sinha 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Finding biconnected components in O(n) t

Finding biconnected components in O(n) time for a class of graphs

✍ Y.Daniel Liang; Chongkye Rhee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A rooted tree is called a single-branch tree if there. is exactly one nonleaf vertex on each level except the bottom level of the tree. We present an O(n) time algorithm for finding biconnected components in a graph G, assuming that a single-branch breadth-first search (SBS) tree of any connected in

A Polynomial-Time Algorithm for Finding

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

✍ Zhivko P. Nedev; Peter T. Wood 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A linear time algorithm for longest (s,t

A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs

✍ John A. Ellis; Manrique Mata; Gary MacGillivray 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 440 KB