Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs

DOI10.1007/S10878-022-00982-8OpenAlexW4313639012MaRDI QIDQ2111523FDOQ2111523

Aifa Wang, Peng Li

Publication date: 17 January 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00982-8

Recommendations

• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
• On the algorithmic complexity of double vertex-edge domination in graphs
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
• Double vertex-edge domination in graphs: complexity and algorithms
• A unified approach to domination problems on interval graphs

zbMATH Keywords

interval graphspolynomial time algorithmdouble vertex-edge dominationvertex-edge domination\(k\)-vertex-edge domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic graph theory and perfect graphs
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
• Bounds on the vertex-edge domination number of a tree
• Vertex-edge domination
• Title not available (Why is that?)
• A unified approach to domination problems on interval graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Double vertex-edge domination
• Vertex-edge domination in graphs
• Vertex-edge domination in graphs
• The longest cycle problem is polynomial on interval graphs
• Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
• Results on vertex-edge and independent vertex-edge domination
• Total vertex-edge domination
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

Cited In (4)

• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
• On \(k\)-vertex-edge domination of graph
• The \(k\) edge-vertex domination problem
• Algorithmic study on liar's vertex-edge domination problem

This page was built for publication: Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111523)