A P-complete graph partition problem
From MaRDI portal
Publication:917313
DOI10.1016/0304-3975(90)90026-EzbMath0704.68059MaRDI QIDQ917313
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
computational complexityP-complete problemsgraph partition problemlexicographical first different than majority labelling
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
This page was built for publication: A P-complete graph partition problem