Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees

DOI10.1016/j.jpdc.2005.04.002zbMath1082.68122OpenAlexW1964642287MaRDI QIDQ2484297

B. S. Panda, Sajal K. Das

Publication date: 1 August 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.04.002

zbMATH Keywords

Hamiltonian cycleParallel algorithmChordal graphPlanar graph\(k\)-Trees

Mathematics Subject Classification ID

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

Related Items (1)

One-phase algorithm for the determination of minimal vertex separators of chordal graphs

This page was built for publication: Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees