The following pages link to (Q4471290):
Displaying 19 items.
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← 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)
- Connected permutation graphs (Q2455587) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs (Q5321692) (← links)
- Certifying induced subgraphs in large graphs (Q6636998) (← links)
