Tree-like parse and polynomial subclasses of search problems

DOI10.1016/0020-0190(86)90042-6zbMath0603.68085OpenAlexW2065591743MaRDI QIDQ1082828

V. Yu. Kryauchyukas

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90042-6

zbMATH Keywords

graph grammarcontext-free grammarstructured objectedtree-like parsing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20)

Related Items (1)

Parallel algorithms for a class of graphs generated recursively

Cites Work

• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-like parse and polynomial subclasses of search problems