A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-94821-8_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Two Formal Analyses of Attack Graphs

English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Informal Proof, Formal Proof, Formalism

Review of Symbolic Logic
MathematicsPhilosophyLogic
2015English

Maximum Induced Forests in Graphs of Bounded Treewidth

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs

2020English

On the Dimension of Posets With Cover Graphs of Treewidth 2

Order
AlgebraGeometryNumber TheoryComputational TheoryMathematicsTopology
2016English

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

2017English

A Formal Proof of the Expressiveness of Deep Learning

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2018English

A Formal Library for Elliptic Curves in the Coq Proof Assistant

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy