Search results for "transitive closure problem"

Found 15 publication records. Showing 15 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Dilip Sarkar, Amar Mukherjee	Design of Optimal Systolic Algorithms for the Transitive Closure Problem.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	transitive closure problem, optimal systolic algorithms, Warshal-Floyd algorithm, pipelined parallel algorithms, RCT diagram, parallel algorithms, data dependency, systolic algorithms
1	Anna Nepomniaschaya	Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem.	PaCT	2007	DBLP DOI BibTeX RDF
1	José-Miguel Benedí, Joan-Andreu Sánchez	Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm.	IbPRIA	2007	DBLP DOI BibTeX RDF
1	Igor Z. Milovanovic, Emina I. Milovanovic, B. M. Randjelovic	Computing Transitive Closure Problem on Linear Systolic Array.	NAA	2004	DBLP DOI BibTeX RDF
1	Edson Norberto Cáceres, Cristiano Costa Argemom Vieira	Revisiting a BSP/CGM Transitive Closure Algorithm.	SBAC-PAD	2004	DBLP DOI BibTeX RDF
1	H. S. Ng, Sui-Tung Mak, Kai-Pui Lam	Field programmable gate arrays and analog implementation of BRIN for optimization problems.	ISCAS	2003	DBLP DOI BibTeX RDF
1	Aris Pagourtzis, Igor Potapov, Wojciech Rytter	Observations on Parallel Computation of Transitive and Max-Closure Problems.	PVM/MPI	2002	DBLP DOI BibTeX RDF
1	Aris Pagourtzis, Igor Potapov, Wojciech Rytter	PVM Computation of the Transitive Closure: The Dependency Graph Approach.	PVM/MPI	2001	DBLP DOI BibTeX RDF
1	Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis	An Experimental Study of Dynamic Algorithms for Directed Graphs.	ESA	1998	DBLP DOI BibTeX RDF
1	Ismail H. Toroslu, Ghassan Z. Qadah	The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF
1	Maria Luisa Bonet, Samuel R. Buss	The Serial Transitive Closure Problem for Trees.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Thore Husfeldt	Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink.	ESA	1995	DBLP DOI BibTeX RDF
1	C. J. Su, K. P. Lam	Digital Circuit Implementation of a Continuous-time Inference Network for the Transitive Closure Problem.	ISCAS	1993	DBLP BibTeX RDF
1	Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure Problem and Its Applications.	ICPP	1990	DBLP BibTeX RDF
1	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points