The greedy algorithm for domination in graphs of maximum degree 3

Author： Seager S.M.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.2, 2004-01, pp. : 53-56

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

By Parfenoff I.  

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 96-108

Academic Press

Access to resources Recommend Favorite

Efficient minus and signed domination in graphs

By Lu C.L.   Peng S.   Tang C.Y.  

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 381-397

Elsevier

Access to resources Recommend Favorite

Almost all graphs with average degree 4 are 3-colorable

By Achlioptas D.   Moore C.  

Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. : 441-471

Elsevier

Access to resources Recommend Favorite

Scheduling in synchronous networks and the greedy algorithm

By Lui K.-S.   Zaks S.  

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 157-183

Elsevier

Access to resources Recommend Favorite

Improved Algorithms and Complexity Results for Power Domination in Graphs

By Guo Jiong   Niedermeier Rolf   Raible Daniel  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 177-202

Springer Publishing Company

Access to resources Recommend Favorite