The problems of determining the maximum cardinality of an independent set of vertices and the minimum cardinality of a, maximal independent set of vertices of a. graph are known to be NP-complete. We provide efficient algorithms for finding these values for path graphs of trees.
机构:
Univ Autonoma Guerrero, Fac Matemat, Carlos E Adame 5, Acapulco, Guerrero, MexicoUniv Autonoma Guerrero, Fac Matemat, Carlos E Adame 5, Acapulco, Guerrero, Mexico
Cabrera Martinez, Abel
Sigarreta Almira, Jose M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Autonoma Guerrero, Fac Matemat, Carlos E Adame 5, Acapulco, Guerrero, MexicoUniv Autonoma Guerrero, Fac Matemat, Carlos E Adame 5, Acapulco, Guerrero, Mexico
Sigarreta Almira, Jose M.
Yero, Ismael G.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Cadiz, Dept Matemat, Escuela Politecn Super Algeciras, Av Ramon Puyol S-N, Algeciras 11202, SpainUniv Autonoma Guerrero, Fac Matemat, Carlos E Adame 5, Acapulco, Guerrero, Mexico
机构:
Kalasalingam Univ, Natl Ctr Adv Res Discrete Math n CARDMATH, CGRF, Krishnankoil 626190, IndiaKalasalingam Univ, Natl Ctr Adv Res Discrete Math n CARDMATH, CGRF, Krishnankoil 626190, India
Arumugam, S.
Rejikumar, K.
论文数: 0引用数: 0
h-index: 0
机构:
NSS Coll, Dept Math, Pandalam 689501, Kerala, IndiaKalasalingam Univ, Natl Ctr Adv Res Discrete Math n CARDMATH, CGRF, Krishnankoil 626190, India