Interval Graph Problems on Reconfigurable Meshes

DOI10.1287/IJOC.7.3.333MaRDI QIDQ4896437zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, James L. Schwing, Jingyuan Zhang

Publication date 20 October 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/841ef8794b0f27d2287663372761ae3d19425718

zbMATH Keywords

shortest pathinterval graphminimum clique coverreconfigurable mesh

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3892606
• Parallel algorithms on interval graphs
• Parallel computation on interval graphs: algorithms and experiments
• scientific article; zbMATH DE number 4049085
• Designing efficient parallel algorithms on interval graphs

Cited in

(3)

• Backup 2-center on interval graphs
• Solving cheap graph problems on Meshes
• Reconfigurable meshes and image processing

This page was built for publication: Interval Graph Problems on Reconfigurable Meshes

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