✦ LIBER ✦

A new algorithm to compute vertex cutsets in a graph

✍ Scribed by Pradip K. Srimani; Danda De; Bhabani P. Sinha

Book ID: 113211713
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 493 KB
Volume: 8
Category: Article
ISSN: 0045-7906
DOI: 10.1016/0045-7906(81)90009-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm to Enumerate All Cutsets of

An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

✍ Tsukiyama, S.; Shirakawa, I.; Ozaki, H.; Ariyoshi, H. 📂 Article 📅 1980 🏛 Association for Computing Machinery 🌐 English ⚖ 691 KB

Vertex-to-vertex pursuit in a graph

✍ Richard Nowakowski; Peter Winkler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one's present vertex or moving to an adjacent vertex; each move is seen

A Parallel Algorithm for Finding Minimum

A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs

✍ E. Dekel; J. Hu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A linear time algorithm to compute a dom

A linear time algorithm to compute a dominating path in an AT-free graph

✍ Derek G. Corneil; Stephan Olariu; Lorna Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

A new algorithm for finding a pseudoperi

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

✍ Paulino, Glaucio H. ;Menezes, Ivan F. M. ;Gattass, Marcelo ;Mukherjee, Subrata 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 867 KB

A new algorithm to compute the discrete

A new algorithm to compute the discrete cosine Transform

✍ Byeong Lee 📂 Article 📅 1984 🏛 IEEE ⚖ 314 KB