Reconstituting beta graphs into an efficacious system

DOI10.1023/A:1008303204427zbMATH Open0956.03004OpenAlexW1518571861MaRDI QIDQ1306167FDOQ1306167

Sun-Joo Shin

Publication date: 7 March 2001

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008303204427

Recommendations

• scientific article; zbMATH DE number 1670608
• scientific article
• Efficient algorithms for computing Reeb graphs
• Graph reconstruction -- some new developments
• A reconstruction algorithm for the essential graph
• Graph reconstruction with a betweenness oracle
• Optimally reconstructing weighted graphs using queries
• Efficient reassembling of graphs. I: The linear case
• Efficient Output-Sensitive Construction of Reeb Graphs
• scientific article

zbMATH Keywords

efficacydeductive systemnaturalnessPeirceexistential graphsBeta systemdiagrammatic system

Mathematics Subject Classification ID

Classical first-order logic (03B10) General logic (03B99)

Cited In (3)

• Title not available (Why is that?)
• An Alternative Reformulation of the Transformation Rules in the Beta Part of Peirce’s Existential Graphs
• Title not available (Why is that?)

This page was built for publication: Reconstituting beta graphs into an efficacious system

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