Characterization of efficiently parallel solvable problems on distance-hereditary graphs

Keyphrases

• Distance-hereditary Graphs 100%
• Decomposition Tree 66%
• Domination Problems 66%
• Optimization Problem 33%
• Problem Solving 33%
• Parallel Algorithm 33%
• Sequential Simulation 33%
• Connection Problem 33%
• Linear-time Algorithm 33%
• Common Property 33%
• Maximum Clique Problem 33%
• Maximum Independent Set Problem 33%
• Vertex Connectivity 33%
• PRAM Model 33%
• Independent Domination 33%
• Graph Optimization 33%

Computer Science

• Tree Decomposition 100%
• Optimization Problem 50%
• Parallel Algorithms 50%
• Sequential Simulation 50%
• Connectivity Problem 50%
• Subgraphs 50%
• Vertex Connectivity 50%
• Independent Set 50%

Mathematics

• Linear Time 100%
• Clique 100%
• CREW PRAM 100%
• Maximum Independent Set 100%