Login / Signup
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
Kristoffer Arnsfelt Hansen
Balagopal Komarath
Jayalal Sarma
Sven Skyum
Navid Talebanfard
Published in:
MFCS (2) (2014)
Keyphrases
</>
high speed
graph properties
algebraic structures
lower bound
worst case
bipartite graph
single point
gallium arsenide
computational complexity
decision problems
directed graph
structural properties
desirable properties
graph mining
graph theoretic