Found: 10
Select item for more details and to access through your institution.
All Separating Triangles in a Plane Graph can be Optimally “Broken” in Polynomial Time.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 405, doi. 10.1142/S012905410000020X
- By:
- Publication type:
- Article
Generating All the Minimal Separators of a Graph.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 397, doi. 10.1142/S0129054100000211
- By:
- Publication type:
- Article
NLC[sub 2]-Decomposition in Polynomial Time.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 373, doi. 10.1142/S0129054100000223
- By:
- Publication type:
- Article
On the Hardness of Recognizing Bundles in Time Table Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 467, doi. 10.1142/S0129054100000235
- By:
- Publication type:
- Article
An Improved Algorithm for Finding Tree Decompositions of Small Width.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 365
- By:
- Publication type:
- Article
Finding Smallest Supertrees Under Minor Containment.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 445, doi. 10.1142/S0129054100000259
- By:
- Publication type:
- Article
On the Clique-Width of Some Perfect Graph Classes.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 423, doi. 10.1142/S0129054100000260
- By:
- Publication type:
- Article
Mod-2 Independence and Domination in Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 355
- By:
- Publication type:
- Article
Some Sufficient Conditions of Learnability in the Limit from Positive Data.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 515, doi. 10.1142/S0129054100000284
- By:
- Publication type:
- Article
A New Weight Balanced Binary Search Tree.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 485, doi. 10.1142/S0129054100000296
- By:
- Publication type:
- Article