Found: 5
Select item for more details and to access through your institution.
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 4, p. 275, doi. 10.1007/s00224-001-1008-4
- By:
- Publication type:
- Article
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 4, p. 299, doi. 10.1007/s00224-001-1015-5
- By:
- Publication type:
- Article
Computing the Optimal Bridge between Two Polygons.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 4, p. 337, doi. 10.1007/s00224-001-1018-2
- By:
- Publication type:
- Article
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 4, p. 353, doi. 10.1007/s00224-001-0008-8
- By:
- Publication type:
- Article
Special Factors and Uniqueness Conditions in Rational Trees.
- Published in:
- Theory of Computing Systems, 2001, v. 34, n. 4, p. 375, doi. 10.1007/s00224-001-1006-6
- By:
- Publication type:
- Article