Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,149 papers from all fields of science
Search
Sign In
Create Free Account
Certifying algorithm
In theoretical computer science, a certifying algorithm is an algorithm that outputs, together with a solution to the problem it solves, a proof that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Clique (graph theory)
Directed acyclic graph
Extended Euclidean algorithm
Formal verification
Expand
Broader (2)
Error detection and correction
Software testing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Empirical analysis of algorithms for the shortest negative cost cycle problem
Matthew Anderson
,
M. Williamson
,
K. Subramani
Discrete Applied Mathematics
2019
Corpus ID: 57379849
2017
2017
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
K. Subramani
,
P. Wojciechowski
Journal of combinatorial optimization
2017
Corpus ID: 46804608
This paper is concerned with the design and analysis of a certifying algorithm for checking the lattice point feasibility of a…
Expand
2015
2015
Characterising parameterized graph classes : certifying algorithms for fixed-parameter tractable problems
Samuel Wilson
2015
Corpus ID: 31988687
In this thesis we consider the problem of characterising parameterized graph classes. The parameterized graph classes we consider…
Expand
2014
2014
On color-critical ($P_{5},\overline{P}_5$)-free graphs
Harjinder S. Dhaliwal
,
A. Hamel
,
C. Hoàng
,
Frédéric Maffray
,
Tyler J. D. McConnell
,
Stefan A. Panait
2014
Corpus ID: 119591995
A graph is $k$-critical if it is $k$-chromatic but each of its proper induced subgraphs is ($k-1$)-colorable. It is known that…
Expand
2014
2014
A Simpl Shortest Path Checker Verification
C. Rizkallah
2014
Corpus ID: 16249828
Verification of complex algorithms with current verification tools in reasonable time is challenging. Certifying algorithms…
Expand
2014
2014
A certifying algorithm for horn constraint systems
Pratik Gupta
2014
Corpus ID: 61237533
2013
2013
An FPT Certifying Algorithm for the Vertex-Deletion Problem
H. Müller
,
Samuel Wilson
International Workshop on Combinatorial…
2013
Corpus ID: 13235794
We provide a fixed-parameter certifying algorithm for the Vertex-deletion problem. An upper bound for the size of the forbidden…
Expand
2011
2011
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
Ruo-Wei Hung
,
Maw-Shang Chang
Applied Mathematics Letters
2011
Corpus ID: 5914878
2010
2010
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs
Ruo-Wei Hung
,
Maw-Shang Chang
Communication Systems and Applications
2010
Corpus ID: 7362845
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The…
Expand
2008
2008
A certifying algorithm for the path cover problem on interval graphs
Maw-Shang Chang
2008
Corpus ID: 17716280
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE