Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

DOI10.1137/S0895480101389880zbMATH Open1018.68021OpenAlexW2080140490MaRDI QIDQ4785697FDOQ4785697

Authors Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen 

Publication date 5 January 2003

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480101389880

zbMATH Keywords

algorithmsdata structuresdistance-hereditary graphsparallel random access machinesubgraph optimization problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1303031
• scientific article; zbMATH DE number 2089962
• Computational Science - ICCS 2004
• An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
• The Hamiltonian problem on distance-hereditary graphs

Cited In (8)

• Linear-time algorithm for paired-domination on distance-hereditary graphs
• Paired-domination problem on distance-hereditary graphs
• Efficiently parallelizable problems on a class of decomposable graphs
• Title not available (Why is no real title available?)
• Unique response Roman domination: complexity and algorithms
• Computational Science - ICCS 2004
• An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
• The Hamiltonian problem on distance-hereditary graphs

This page was built for publication: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

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