Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The complexity of cubical graphs - MaRDI portal

The complexity of cubical graphs

From MaRDI portal

Publication:3736911

Jump to:navigation, search

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)

zbMATH Keywords

embedding dimension edge coloring NP-complete subgraph of a hypercube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Hypercube embedding heuristics: An evaluation ⋮ Boolean autoencoders and hypercube clustering complexity ⋮ On the complexity of the embedding problem for hypercube related graphs ⋮ Corrigendum to ``The complexity of cubical graphs

This page was built for publication: The complexity of cubical graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3736911&oldid=17253659"