OpenAlex
PricingAboutJobs
Log inGet started
Work

A spanning tree transitive closure algorithm

HTML

Year: 2003
Type: conference-paper
Source: IEEE International Conference on Data Engineering (ICDE)
Parent work: [1992] Eighth International Conference on Data Engineering
DOI: 10.1109/icde.1992.213213
Authors: S. Dar, H.V. Jagadish
Institutions: AT&T (United States), University of Wisconsin–Madison
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: transitive closure, spanning trees, blocking, I/O cost reduction, path problems, graph algorithms, information sharing
SDG: Industry, innovation and infrastructure

Open Access status: closed
OpenAlex ID: W2143081325
FWCI:
Cites: 33
Cited by: 15
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security