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 complexity; P-complete problems; graph partition problem; lexicographical first different than majority labelling
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work