THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS

DOI10.1080/10637199508915531zbMath1049.68925OpenAlexW2090219467MaRDI QIDQ4820130

Madhumangal Pal, G. P. Bhattacharjee

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199508915531

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs ⋮ Perfect edge domination and efficient edge domination in graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ Solving the weighted efficient edge domination problem on bipartite permutation graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted perfect domination problem
• A unified approach to domination problems on interval graphs
• A new upper bound on the complexity of the all pairs shortest path problem
• Efficient edge domination problems in graphs
• Perfect codes in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Steiner trees, connected domination and strongly chordal graphs
• Towards a theory of domination in graphs

This page was built for publication: THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS