✦ LIBER ✦

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs

✍ Scribed by Bera; Pal; Pal

Publisher: Springer
Year: 2003
Tongue: English
Weight: 114 KB
Volume: 36
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-002-1004-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for finding all

A linear time algorithm for finding all hinge vertices of a permutation graph

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

An efficient algorithm to solve connecti

An efficient algorithm to solve connectivity problem on trapezoid graphs

✍ Prabir K. Ghosh; Madhumangal Pal 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

Computational results on an algorithm fo

Computational results on an algorithm for finding all vertices of a polytope

✍ T. H. Mattheiss; Brian K. Schmidt 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 627 KB

A linear time algorithm for finding dept

A linear time algorithm for finding depth-first spanning trees on trapezoid graphs

✍ Hon-Chan Chen; Yue-Li Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Let G be a connected graph of n vertices and m edges. The problem of finding a depth-first spanning tree of G is to find a subgraph of G connecting the n vertices with n -1 edges by depth-first search. In this paper, we propose an O(n) time algorithm for solving this problem on trapezoid graphs. Our

The optimal sequential and parallel algo

The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs

✍ Bera, Debashis ;Pal, Madhumangal ;Pal, Tapan K. 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

An optimal pram algorithm for a spanning

An optimal pram algorithm for a spanning tree on trapezoid graphs

✍ Debashis Bera; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 143 KB