Graph complexity and slice functions

DOI10.1007/S00224-002-1068-0zbMath1039.68097OpenAlexW2108073694MaRDI QIDQ1405800

Satyanarayana V. Lokam

Publication date: 26 August 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/42364

zbMATH Keywords

Boolean complexitycomputation on graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On set intersection representations of graphs ⋮ On covering graphs by complete bipartite subgraphs

This page was built for publication: Graph complexity and slice functions