Some algorithmic results for eternal vertex cover problem in graphs

DOI10.1007/978-3-031-27051-2_21MaRDI QIDQ6091167

Arti Pandey, Kaustav K. Paul

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

zbMATH Keywords

chain graphscographssplit graphseternal vertex cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized algorithm for eternal vertex cover
• Modular decomposition and transitive orientation
• Eternal vertex cover on bipartite graphs
• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• A new lower bound for the eternal vertex cover number of graphs

This page was built for publication: Some algorithmic results for eternal vertex cover problem in graphs