On Graph Complexity
From MaRDI portal
Publication:3419765
DOI10.1017/S0963548306007620zbMath1160.68480OpenAlexW2084471831MaRDI QIDQ3419765
Publication date: 7 February 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548306007620
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (15)
The landscape of communication complexity classes ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product ⋮ A calculus for measuring the elegance of abstract graphs ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Dimension-free bounds and structural results in communication complexity ⋮ String Matching: Communication, Circuits, and Learning. ⋮ Inequalities for entropy-based measures of network information content ⋮ Bounded-depth succinct encodings and the structure they imply on graphs ⋮ On set intersection representations of graphs ⋮ Unnamed Item ⋮ Depth Reduction for Circuits with a Single Layer of Modular Counting Gates ⋮ On covering graphs by complete bipartite subgraphs ⋮ Consistency matters: revisiting the structural complexity for supply chain networks
This page was built for publication: On Graph Complexity
