On the decidability of integer subgraph problems on context-free graph languages

DOI10.1007/3-540-54458-5_86MaRDI QIDQ4266530zbMATH OpenFDO

Authors Egon Wanke

Publication date 3 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54458-5_86

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: On the decidability of integer subgraph problems on context-free graph languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4266530)