List of Papers in 1994
Papers
- X.Zhou, S.Nakano and T.Nishizeki,
"A parallel algorithm for edge-coloring partial k-trees,"
In Proc. of the Fourth Scandianavian Workshop on Algorithm Theory, Lect. Notes in Computer Science, Springer-Verlag, 824, pp.359-369, 1994.
- X.Zhou and T.Nishizeki,
"Edge-coloring and f-coloring for various classes of graphs,"
In Proc. of the Fifth International Symposium on Algorithms and Computation, Lect. Notes in Computer Science, Springer-Verlag, 834, pp.199-207, 1994.
- X.Zhou and T.Nishizeki,
"An efficient algorithm for edge-ranking trees,"
In Proc. of the Second Europian Symposium on Algorithms, Lect. Notes in Computer Science, Springer-Verlag, 855, pp.118-129, 1994.
- X.Zhou and T.Nishizeki,
"Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees"
In Proc. of the International Symposium on Parallel Architectures, Algorithms and Networks, pp.167-174, 1994.
- X. Zhou and T.NIshizeki,
"Finding Optimal Edge-Rankings of Trees -A Correct Algorithm-,"
In Proc. of JSPS-NUS Seminar on Computing, pp.23-35, 1994.
- μαΑκ, ¬Fμ, ΌΦ²v,
"OtπcOp»·ιό`ΤASY,"
Mw_(A), J77-A, 3, pp.543-546, 1994.
- S.Nakano and T.Nishizeki,
"Edge-coloring problems for graphs,"
Interdisciplinary Information Sciences, Vol.1, No.1, pp.19-32, 1994.
- μαΑκ, ΌΦ²v,
"Uniform Scheduling of File Transfers,"
ζ7ρ ρHΖVXeyδς[NVbv, pp.327-332, 1994.
- N.Kanamaru, T.Nishizeki and T.Asano,
"Efficient Enumeration of Grid Points in a Convex Polygon and its Application to Integer Programming,"
Int. J. Computational Geometry & Applications, 4, pp.69-85, 1994.
- T.Nishizeki and S.Poljak,
"k-Connectivity and Decomposition of Graph into Forests"
Discrete Applied Mathematics, 55, pp.295-301, 1994.
- ΄~η, ιΨΟ, ΌΦ²v,
"½ΚOtΕ·³ΜaΕ¬Θρπ·ΉπίιASY,"
Mw_(A), J77-A, 3, pp.447-459, 1994.