Finding the description of structure by counting method: a case study

DOI10.1007/978-3-642-18381-2_38MaRDI QIDQ3075538zbMATH OpenOpenAlexWikidataFDO

Authors Ahti Peder, Mati Tombak

Publication date 15 February 2011

Published in SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18381-2_38

zbMATH Keywords

family of propositional formulaeinteger sequencesuperpositional graph{\#}SAT

Mathematics Subject Classification ID

Classical propositional logic (03B05) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Superpositional graphs and finding the description of structure by counting method
• Superpositional graphs
• About supergraphs. III
• scientific article; zbMATH DE number 4099342
• AutoGraphiX: an automated system for finding conjectures in graph theory

Cites work

• Graph-Based Algorithms for Boolean Function Manipulation
• Hipparchus, Plutarch, Schroder, and Hough
• Superpositional graphs
• Superpositional graphs and finding the description of structure by counting method
• The On-Line Encyclopedia of Integer Sequences

Cited in

(2)

• Counting unlabeled structures
• Superpositional graphs and finding the description of structure by counting method

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Finding the description of structure by counting method: a case study

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