405 citations found. Retrieving documents...
R. E. Tarjan [1972], "Depth-first search and linear graph algorithms", SIAM Journal on Computing, 1, pp. 146-160.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Triangular Decomposition Methods for Solving Reducible - Nonlinear Systems Of   (Correct)

No context found.

R. E. Tarjan [1972], "Depth-first search and linear graph algorithms", SIAM Journal on Computing, 1, pp. 146-160.


Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006)   (Correct)

No context found.

R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-- 160, 1972.


Efficient Field-Sensitive Pointer Analysis for C - David Pearce Imperial   (Correct)

No context found.

R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146--160, 1972.


Maximizing Sharing of Protected Information - Steven Dawson Sabrina (2002)   (2 citations)  (Correct)

No context found.

R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1(2):146--160, June 1972.


Large-Scale Directed Model Checking LTL - Edelkamp, Jabbar (2006)   (Correct)

No context found.

R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, (1):146--160, 1972.


Safe Separators for Treewidth - Hans Bodlaender Arie (2003)   (Correct)

No context found.

R. E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Comput., 1:146--160, 1972.


Tree Decompositions With Small Cost - Irit Katriel Hans (2005)   (2 citations)  (Correct)

No context found.

R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-- 160, June 1972.


Modeling Physical Variability for Synthetic MOUT Agents - Sukthankar, Mandel.. (2004)   (Correct)

No context found.

R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing 1, pages 146--160, 1972.


Modeling Physical Capabilities of Humanoid Agents.. - Sukthankar.. (2004)   (Correct)

No context found.

R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing 1, pages 146--160, 1972.


Book Title - Book Editors Ios   (Correct)

No context found.

R.E. Tarjan, "Depth first search and linear graph algorithms," SIAM Journal of Computing, 1(2):146--160, June 1972.


The alldifferent Constraint: A Survey - van Hoeve (2001)   (3 citations)  (Correct)

No context found.

R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146--160, 1972.


Boolean Equation Solving as Graph Traversal - Brian Herlihy Peter   (Correct)

No context found.

Tarjan, R. E. (1972), `Depth-first search and linear graph algorithms', SIAM Journal of Computing 1(2), 146--170.


Mining Relaxed Graph Properties in Internet - Hämäläinen, Toivonen, al.   (Correct)

No context found.

R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146--160, 1972.


Generic Pickling and Minimization - Tack, Kornstaedt, Smolka (2005)   (1 citation)  (Correct)

No context found.

Tarjan, R. E., Depth first search and linear graph algorithms, SIAM Journal on Computing 1 (1972), pp. 146--160.


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160


A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005)   (Correct)

No context found.

R. Tarjan (1972), Depth-first search and linear graph algorithms, in 'SIAM Journal on Computing', Vol. 1, pp. 146--160

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC