✦ LIBER ✦

An -time algorithm for the paired domination problem on permutation graphs

✍ Scribed by Evaggelos Lappas; Stavros D. Nikolopoulos; Leonidas Palios

Book ID: 119233244
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 334 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Algorithm for the Paired-Dom

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs

✍ Ruo-Wei Hung 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 809 KB

Fast algorithms for the dominating set p

Fast algorithms for the dominating set problem on permutation graphs

✍ Kuo-Hui Tsai; Wen-Lian Hsu 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 616 KB

A new approach for the domination proble

A new approach for the domination problem on permutation graphs

✍ Y. Liang; C. Rhee; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 933 KB

An Optimal Algorithm to Solve the All-Pa

An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs

✍ Sukumar Mondal; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

Solving the weighted efficient edge domi

Solving the weighted efficient edge domination problem on bipartite permutation graphs

✍ Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Given a simple graph G = (V, E), an edge (u, u) E E is said to dominate itself and any edge (u,x) or (u,x), where x E V. A subset D C E is called an efficient edge dominating set of G if all edges in E are dominated by exactly one edge of D. The efficient edge domination problem is to find an effici

Labelling algorithms for paired-dominati

Labelling algorithms for paired-domination problems in block and interval graphs

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 368 KB