scientific article; zbMATH DE number 219271
From MaRDI portal
Publication:4694758
zbMath0768.68053MaRDI QIDQ4694758
Antonio J. Lozano, José L. Balcázar
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityboundsadjacency matrixNP-completenessregular graphsBoolean functionBoolean circuitrepresented graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Languages represented by Boolean formulas ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ Representing graphs implicitly using almost optimal space ⋮ Automata-Theoretic Model Checking Revisited ⋮ Succinct representation, leaf languages, and projection reductions ⋮ On the complexity of data disjunctions.
This page was built for publication:
