The complexity of cubical graphs
From MaRDI portal
Publication:3736911
DOI10.1016/S0019-9958(85)80012-7zbMath0601.68040MaRDI QIDQ3736911
Foto N. Afrati, George Papageorgiou, Christos H. Papadimitriou
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Boolean autoencoders and hypercube clustering complexity, Hypercube embedding heuristics: An evaluation, On the complexity of the embedding problem for hypercube related graphs, Corrigendum to ``The complexity of cubical graphs