The following pages link to Certifying algorithms (Q465678):
Displaying 50 items.
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Cyclability in graph classes (Q833007) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Edge-orders (Q1741850) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- A framework for the verification of certifying computations (Q2351144) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
- λ > 4 (Q3452770) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826) (← links)
- (Q5009621) (← links)
- Cogent: uniqueness types and certifying compilation (Q5019022) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
- On fair division for indivisible items (Q5090961) (← links)
- (Q5091003) (← links)
- Trustworthy Graph Algorithms (Invited Talk) (Q5092359) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- (Q5158499) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
