Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

DOI10.1137/S0895480101389880zbMath1018.68021OpenAlexW2080140490MaRDI QIDQ4785697

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

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

algorithmsdistance-hereditary graphsdata structuresparallel random access machinesubgraph optimization problems

Mathematics Subject Classification ID

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

Related Items (5)

Unique response Roman domination: complexity and algorithms ⋮ 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 ⋮ The Hamiltonian problem on distance-hereditary graphs

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