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

DOI10.1006/INCO.1994.1063MaRDI QIDQ1333275zbMATH OpenOpenAlexFDO

Authors Egon Wanke

Publication date 13 September 1994

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1994.1063

zbMATH Keywords

decidabilityinteger subgraph problems

Mathematics Subject Classification ID

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

Recommendations

• Efficient decision procedures for graph properties on context-free graph languages
• scientific article; zbMATH DE number 4049098
• The complexity of connectivity problems on context-free graph languages
• scientific article; zbMATH DE number 965

Cited in

(5)

• Decidability of the finiteness of ranges of tree transductions
• The complexity of connectivity problems on context-free graph languages
• scientific article; zbMATH DE number 4060749 (Why is no real title available?)
• scientific article; zbMATH DE number 56048 (Why is no real title available?)
• Efficient decision procedures for graph properties on context-free graph languages

This page was built for publication: On the decidability of certain 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 Q1333275)