( en | de | ru )

 

Disambiguation of "Nishizeki, Takao"

Author of the publication

copydeleteadd this publication to your clipboard
A Better than "Best Possible" Algorithm to Edge Color Multigraphs.

, , and . J. Algorithms, 7 (1): 79-104 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Takao Tsuboi

Takao Ito

Mario Takao Inoue

 

Other publications of authors with the same name

Convex Grid Drawings of Four-connected Plane Graphs., , and . Int. J. Found. Comput. Sci., 17 (5): 1031-1060 (2006)Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs., , and . Discret. Comput. Geom., 41 (4): 643-670 (2009)Grid Drawings of 4-Connected Plane Graphs., , and . Discret. Comput. Geom., 26 (1): 73-87 (2001)Improvements of HITS Algorithms for Spam Links., , and . APWeb/WAIM, volume 4505 of Lecture Notes in Computer Science, page 479-490. Springer, (2007)Sequential and parallel algorithms for edge-coloring series-parallel multigraphs., , and . IPCO, page 129-145. CIACO, (1993)A Linear Algorithm for Edge-Coloring Partial k-Trees., , and . ESA, volume 726 of Lecture Notes in Computer Science, page 409-418. Springer, (1993)Orthogonal drawings of series-parallel graphs with minimum bends., and . WALCOM, page 3-12. Bangladesh Academy of Sciences (BAS), (2007)Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (5): 907-916 (2007)Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends., and . SIAM J. Discret. Math., 22 (4): 1570-1604 (2008)A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , and . Int. J. Found. Comput. Sci., 10 (2): 171-194 (1999)