✦ LIBER ✦

Linear Time Algorithms for Generalized Edge Dominating Set Problems

✍ Scribed by André Berger; Ojas Parekh

Publisher: Springer
Year: 2007
Tongue: English
Weight: 315 KB
Volume: 50
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9057-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum to: Linear Time Algorithms for G

Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems

✍ André Berger; Ojas Parekh 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 172 KB

Linear Time Algorithms for Finding a Dom

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

✍ Noga Alon; Shai Gutner 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 310 KB

Homogeneous sets and domination: A linea

Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs

✍ Falk Nicolai; Thomas Szymczak 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Fixed Parameter Algorithms for DOMINATIN

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

✍ Alber; Bodlaender; Fernau; Kloks; Niedermeier 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 310 KB

A steepest edge active set algorithm for

A steepest edge active set algorithm for solving sparse linear programming problems

✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB