Serial and parallel algorithms for (k,2)-partite graphs

DOI10.1006/JPDC.1994.1076MaRDI QIDQ1344531zbMATH OpenOpenAlexFDO

Authors John Ellis, Manrique Mata-Montero, Hausi A. Müller

Publication date 6 November 1995

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

Full work available at URL https://doi.org/10.1006/jpdc.1994.1076

zbMATH Keywords

layered graphsmaximum independent set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Linear time algorithms for NP-hard problems restricted to partial k- trees
• scientific article; zbMATH DE number 637355
• scientific article; zbMATH DE number 3963195
• scientific article; zbMATH DE number 3917707
• Computational Science - ICCS 2004

Cited in

(4)

• Layered graphs: applications and algorithms
• An efficiently solvable graph partition problem to which many problems are reducible
• Tripartite graphs with given degree set
• scientific article; zbMATH DE number 5863491 (Why is no real title available?)

This page was built for publication: Serial and parallel algorithms for \((k,2)\)-partite graphs

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