Holes and Dominoes in Meyniel Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 127, doi. 10.1142/S0129054199000113
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 1999 AND VI 10 AND IP 2
Results: 6
1
2
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 147, doi. 10.1142/S0129054199000125
- By:
- Publication type:
- Article
3
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 171, doi. 10.1142/S0129054199000137
- By:
- Publication type:
- Article
4
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 195, doi. 10.1142/S0129054199000149
- By:
- Publication type:
- Article
5
On the Complexity of Some Adaptive Polling Algorithms in General Networks.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 211, doi. 10.1142/S0129054199000150
- By:
- Publication type:
- Article
6
A Graph Based Davidson Algorithm for the Graph Partitioning Problem.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 2, p. 225, doi. 10.1142/S0129054199000162
- By:
- Publication type:
- Article