Second-order properties of undirected graphs
From MaRDI portal
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- A linear-time algorithm for finding a minimum spanning pseudoforest
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- An algebraic framework for minimum spanning tree problems
- Combinatory logic. With two sections by William Craig.
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- Extending Sledgehammer with SMT solvers
- scientific article; zbMATH DE number 3648772 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 194258 (Why is no real title available?)
- scientific article; zbMATH DE number 2110621 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3343732 (Why is no real title available?)
- Introduction to Relation Algebras
- Isabelle/HOL. A proof assistant for higher-order logic
- Minimal relation algebras
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- On automated program construction and verification
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Pair-Dense Relation Algebras
- Relation algebras: Concept of points and representability
- Relational characterisations of paths
- Relational mathematics
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Winskel is (almost) right: Towards a mechanized semantics textbook
Describes a project that uses
Uses Software
This page was built for publication: Second-order properties of undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695354)
