Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Home
Publications
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Author:
JL
Jens Lagergren
Jens Lagergren
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 January 1996
journal article
Published by
Elsevier
in
Journal of Algorithms
Vol. 20
(1)
,
20-44
DOI:
10.1006/jagm.1996.0002
Abstract
No abstract available
Keywords
ALGORITHMS FOR GRAPHS
TREE WIDTH
BOUNDED TREE
EFFICIENT PARALLEL ALGORITHMS
Cited
Cited by 56 articles
Scroll to top