✦ LIBER ✦

An optimal algorithm for finding dominating cycles in circular-arc graphs

✍ Scribed by J.Mark Keil; Doug Schaefer

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 972 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90201-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Parallel Algorithm for Find

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 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

An algorithm for finding the essential s

An algorithm for finding the essential sets of arcs of certain graphs

✍ Pierre Robert 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A linear algorithm for finding Hamiltoni

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

✍ Takao Asano; Shunji Kikuchi; Nobuji Saito 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 901 KB

Efficient algorithms for centers and med

Efficient algorithms for centers and medians in interval and circular-arc graphs

✍ Sergei Bespamyatnikh; Binay Bhattacharya; Mark Keil; David Kirkpatrick; Michael 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

## Abstract The __p__‐center problem is to locate __p__ facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The __p__‐median problem is to locate __p__ facilities on a network so as to minimize the average distance from a demand point to its c

An algorithm for prescribed multiple dom

An algorithm for prescribed multiple domination in arbitrary graphs

✍ M. Satratzemi; K.G. Margaritis; C. Tsouros 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 384 KB